Author: Uri Blass
Date: 05:28:02 09/27/03
Go up one level in this thread
On September 27, 2003 at 08:14:23, James T. Walker wrote: >On September 26, 2003 at 14:09:59, Mihaly Szalai wrote: > >>On September 26, 2003 at 13:53:18, James T. Walker wrote: >> >>> >>>Rebel 12 finds Be8 a3 Bxg6 hxg6 h7 a2 h8B in 5.6 seconds (18 ply) on my XP2400+. >>> Of course Rebel does not use tablebases either. Does this mean that Rebel is >>>stronger than Junior? >> >>In this position, certainly. >> >>Thanks >>Mihaly > >Does this position have much greater importance than all others (10^115). You >can do this to ANY engine available. That is find a position where all others >are better. It means nothing in terms of overall strength. It does point out a >problem that might be fixed if the programmer considered it important. Problem >is quite often fixing this will cause some other problem. Everything is a >compromise. >Jim The problem in this case seem to be not that junior is slower but that Junior cannot find it because of some selective search algorithm or some wrong knowledge about draws. Uri
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.