Author: Tony Werten
Date: 23:57:04 03/25/03
Go up one level in this thread
On March 25, 2003 at 17:30:52, martin fierz wrote: >i computed some checkers endgame databases with retrograde analysis based on the >paper by the chinook team. for larger databases, i have a memory size problem; >specially as win32 only allows a process to use 2GB. >i once heard that it was possible to compute a win/loss/draw endgame database >using only 1 bit per position as opposed to 2 bits as i was using up to now (and >like in the chinook paper). The only way I know of doing this is make an assumption about the position. If on side has an advantage you could use win/no win. With "no win" you don't care about wether it's a draw or a loss. It's the wrong path anyway. ( Or the right, depends on whose move it is ) The only thing you need is a "decisionmaker" when the weaker side has 2 "no loss" moves to decide wich is best. ( ie 1 might be a draw and 1 a win ) Tony > >does someone here know more about this? i'm looking either for an explanation >for dummies, or for a reference to a paper. > >thanks in advance > martin
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.