Author: Bruce Cleaver
Date: 09:34:49 02/17/04
Go up one level in this thread
You are right, the tablebase program is short! I meant the second thing you stated, that of finding shortcuts that lead to the same results as the tablebases without actually using tablebases (and all the zillions of Petabytes that would imply for 32-men). For example, when mating with a king & Rook vs. lone King, we describe the process of cutting off the opponent's king rank by rank or file by file, then delivering mate. The process I describe wouldn't have to have the minimum number of moves, just be able to deliver the win (should such exist). I doubt such a process exists, or if it does, that it can be described in a useable form that is substantially smaller than the tablebases themselves.
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.