Presentation on theme: "By Michael Coco. Setting up the board Two dimensional array board[x][y] First column second row is 10 Walls will be labeled with 2 Open positions."— Presentation transcript:
Moves(peg) continued… The Algorithm continues, checking up, down and side to side. When it comes to a single occupied position it will backup and try another angle pop(); board[x][y]=1; board[x2][y2] = 1; board[x3][y3] = 0; pegs++; Return False
pop Pops the moves off the stack when moves have to be backed up.
The moves with q value are the moves that you must make to solve the algorithm. However this is not the only solution, it is simply the first one this algorithm has found