Free Trial

Safari Books Online is a digital library providing on-demand subscription access to thousands of learning resources.

  • Create BookmarkCreate Bookmark
  • Create Note or TagCreate Note or Tag
  • PrintPrint
Share this Page URL
Help

17. Advanced Pointers > Data Structures for a Chess Program

Data Structures for a Chess Program

One of the classic problems in artificial intelligence is the game of chess. As this book goes to press, the Grandmaster who beat the world’s best chess-playing computer last year has lost to the computer this year (1997).

We are going to design a data structure for a chess-playing program. In chess, you have several possible moves that you can make. Your opponent has many responses to which you have many answers, and so on, back and forth, for several levels of moves.

Our data structure is beginning to look like a tree. This structure is not a binary tree because we have more than two branches for each node, as shown in Figure 17-14.


  

You are currently reading a PREVIEW of this book.

                                                                                                                    

Get instant access to over $1 million worth of books and videos.

  

Start a Free 10-Day Trial


  
  • Safari Books Online
  • Create BookmarkCreate Bookmark
  • Create Note or TagCreate Note or Tag
  • PrintPrint