#
#  The Rogo problem from 2011-01-07
#  best: 36
#  
rows = 12
cols = 7
max_steps = 16
W = 0
B = -1
problem = [
 # 1 2 3 4 5 6 7
  [4,7,W,W,W,W,3], #  1
  [W,W,W,W,3,W,4], #  2
  [W,W,4,W,7,W,W], #  3
  [7,W,3,W,W,W,W], #  4
  [B,B,B,W,3,W,W], #  5
  [B,B,W,7,W,W,7], #  6
  [B,B,W,W,W,4,B], #  7
  [B,4,4,W,W,W,B], #  8
  [B,W,W,W,W,3,B], #  9
  [W,W,3,W,4,B,B], # 10
  [3,W,W,W,W,B,B], # 11
  [7,W,7,4,B,B,B]  # 12
]

# Copyright 2011 Hakan Kjellerstrand hakank@bonetmail.com
#
# Licensed under the Apache License, Version 2.0 (the "License"); 
# you may not use this file except in compliance with the License. 
# You may obtain a copy of the License at 
#
#     http://www.apache.org/licenses/LICENSE-2.0 
#
# Unless required by applicable law or agreed to in writing, software 
# distributed under the License is distributed on an "AS IS" BASIS, 
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 
# See the License for the specific language governing permissions and 
# limitations under the License.