Author: leonid
Date: 11:34:58 07/27/02
Go up one level in this thread
On July 27, 2002 at 12:55:49, Dan Wulff wrote: >Hi Leonid! > >This kind of position is being posted every week (more or less), and is in >itself quite pointless, since it can never arise from normal play. It is pointless to play games when person have practical mind. From "practical point of view" this position is expected to be solved by mate searcher that should work like default search in each chess program. By solving similar positions everyone have good expectation to spot its bugs otherwise invisible. In my default search for mate, simplest one (selective) is more complex that logic used for solving this position. This position demand "simple selective" search, when in my program search is done by "complex selective" but only at shorter depth. Simple selective - attacking moves are only checking one. Complext selective - few plys goes by brute force search and only later by "simple selective". In my program two searches for mate are executed before each positional move. First is complex selective and only later, at much shalow depth, by brute force. Solving positions like above permitted me to create, probably, one of the most quick selective ever done and one between the best ever created for brute force. This position was solved in 12 moves by simple selective in 0.33 second. Celeron 600Mhz. No hash. By brute force mine look only 10 moves deep and it took 78 minutes. Cheers, Leonid. >Greetings > >Dan Wulff >(The Gandalf Team)
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.