Unformatted text preview: g" positions. Alpha-beta Pruning Stops evaluating a move in the search tree when it finds a move that is worse than its previously examined move.
Minimax algorithm recursive algorithm that assigns values to each players' move, makes the move that puts your opponent in the worse possible situation. Other Stuff
Open Book 4000 opening moves that Deep Blue plays well on. Extended Book 700,000 Grandmaster matches Endgame Database All positions with 5 or fewer pieces. Time Control Normal Time (total time left/number of moves left) and Panic Time (1/3 of Normal Time). Works Cited
"Deep Blue." Campbell, Murray. Hoane Jr., A. Joseph. Hsu, Feng-hsiung. August 1, 2001. http://sjeng.org/ftp/deepblue.pdf. Wikipedia. http://en.wikipedia.org/wiki/Deep_Blue_(ches s_computer)....
View Full Document
- Fall '08
- Computer chess, Deep Blue