Author: Jaime Benito de Valle Ruiz
Date: 16:18:03 10/21/03
Go up one level in this thread
On October 21, 2003 at 19:11:37, Uri Blass wrote: >On October 21, 2003 at 18:55:46, Jaime Benito de Valle Ruiz wrote: > >>Yes, it is a hard position for programs... that are used to prune "useless" and >>"improbable" situations in order to find useful lines in normal games. My >>program, after removing some selective search prunning functions, finds the >>answer in almost no time, but if I leave the program like that, it's crap under >>normal circumstances and has no chance against any other programs/humans. >>This is a useful position for a "health check", or maybe for Qsearch >>optimization, but othersise it's not real!! A real headache for people in a >>chess magazine anyway. > >I suspect that the problem of most normal chess programs is not too much pruning >but big qsearch when 99.9% of the nodes are qsearch nodes. > >Uri I agree with you!!! My program spends a ridiculous amount of the search in useless Q-nodes. It's an extremely tactical position that would never happen in a normal game (because either player would have found the way to win long time ago).
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.