August 2018
Beginner
334 pages
10h 19m
English
We define a new type of move for the board that works well with the base algorithms because they make use of it only at a high level as a data structure. The recipe's bread and butter comes from overriding the virtual functions from the Board class to model the problem. We use a two-dimensional integer array for storing the players' moves on the board (0 representing an empty place), and we work out a heuristic for defining the value of a given state regarding its neighbors.
Read now
Unlock full access