Author: Omid David
Date: 03:37:50 11/03/02
Go up one level in this thread
On November 03, 2002 at 06:00:14, GuyHaworth wrote: > >Would you say the same about a game of Nim with three piles of N matches - N >being suitably large. > >You might ... but the answer is 'no': Nim is solved already. > > >Why assume that it is necessary to search every position? >I'm quite handy at KQK, KQQK, etc without needing to search. > What about KBNK? You know that it is a victory, and will most probably win the game without any problem. But may programs cannot do so without the use of tablebases (the same "database of positions" I mentioned). Now, how big can this database eventually grow? Simple math shows that it can never pass a certain limit. (e.g. 7 men tablebases seem out of the question at the moment, let alone a 32 men tablebase!) >g
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.