December 2016
Intermediate to advanced
376 pages
9h 5m
English

The Reversegam AI algorithm from Chapter 15 is simple, but it beats me almost every time I play it. Because the computer can process instructions quickly, it can easily check each possible position on the board and select the highest-scoring move. It would take me a long time to find the best move this way.
The Reversegam program had two functions, getPlayerMove() and getComputerMove(), which both returned the move selected as a two-item list in the format [x, y]. Both functions also had the same parameters, the game board data structure and one type of tile, but the returned moves came from different sources—either ...
Read now
Unlock full access