|Figure 1. Miniature example (W between 3 and 4) of a full-width search tree at D=2. Move 1 is preferred because the best (minimizing) reply by the opponent still leaves the program with a higher score than the alternatives.|
Copyright © 1998 Timothy McGrew. All rights
reserved. International copyright secured.
File Date: 7.10.98