Author: Albert Bertilsson
Date: 09:03:53 03/03/03
Go up one level in this thread
On March 03, 2003 at 11:53:29, Ulrich Tuerke wrote: >On March 03, 2003 at 11:26:36, Albert Bertilsson wrote: > >>Hmm... that might be it, since the opponent move sacrificed the own Queen and >>only delayed the mate with one full move. >> >>But I still have a tough time to understand this... > >In fact it was me, who was confusing things. See my reply to Uri. >One reason for the behavior of your engine may be that you stop search whenever >finding a mate - instead of searching fr a shorter one ? > >Uli > >>I see the A-B as searching for the best moves you can find, the next ply it >>searches for the best move the opponent can do (and loosing a Queen is better >>than an early mate) so why didn't my program also realize that the opponent >>would rather sacrifice the queen than face defeat? >> >>/Regards Albert That must be it, when the mate is found it can't find the shorter one, because it has found a way to finish the game (there is no better move). Basically it comes down to luck then. /Regards Albert
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.