Author: Ed Schröder
Date: 10:52:43 03/04/00
Go up one level in this thread
On March 04, 2000 at 12:56:41, Djordje Vidanovic wrote: >Take a look at this position. Arose from a game a friend played against Chess >Genius 5.0 on his AMD K6/200 (only 4MB hash): > >[D]k7/1b6/8/8/2Q5/8/6p1/6K1 w - - > > >Genius was set at 5 seconds per move and could not find the win (marching his >King towards the enemy....). Please try your programs at faster time controls >and let me know how they do. > >How exasperatingly dumb programs can be at times! BTW, I had to time to test >only Shredder 3 and it found the winning sequence easily. > > >*** Djordje Not having tried this position on my own baby consider this: why add extra chess knowledge if these kind of things can so easily seen by search. No need to do things twice as the extra knowledge is only lowering the NPS of a program. I am not saying this is true for this position only that programmers often let do search the work instead of adding extra chess knowledge that is not needed anymore now that PC's are are so fast and becoming faster and faster and faster..... As you see in some cases you can even make your program stronger by removing chess knowledge. These cases are exceptional but they do exist. Ed
This page took 0.01 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.