In Part 1 of this article, I explained how a chess program plays the opening, and I also outlined the Minimax procedure that is used to play the middle game. This blog continues the discussion by revealing the primary difficulty faced by a computer chess program, and how that difficulty is overcome. As before, we will refer to our nefarious computer opponent as the satanic "Chessifer". Also as stated in Part 1, you need no background in computer science to understand this discussion
↧