Author: Jari Huikari
Date: 06:08:13 09/14/98
One my friend explained so well that even I understood the principle of pruning search tree in chess program: I have found value for a move, by taking look for opponents possible replies to it. When I evaluate next move, it's enough to find the first opponents reply, which means worse score than that of previous move's. And I don't have to take look to more replies, because I know previous move was better. Implementing this however made my program play strange moves, sacrificing queens for no reason and that kind of things. Now I ask, why that could be. Are there depths in iterative deepening, which should be searched all the replies and exactly how bad reply could be found, without doing a cutoff? Jari
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.