Author: martin fierz
Date: 01:26:46 03/26/03
Go up one level in this thread
On March 25, 2003 at 18:52:46, Renze Steenhuisen wrote: >If you aren't yet using all mirror possibilities of the board, you might not be >on 1 bit position yet! > >But hah, why don't you go reading the articles on this subject. > >ICCA Journal, Volume 22: Number 1 (March 1999) > Endgame Databases and Efficient Index Schemes for Chess (E.A. Heinz) > >ICCA Journal, Volume 22: Number 2 (June 1999) > Knowledgeable Encoding and Querying of Endgame Databases (E.A. Heinz) > >ICCA Journal, Volume 22: Number 4 (December 1999) > KQQKQQ and the Kasparov-World Game (E.V. Nalimov, C. Wirth, and >G.McC.Haworth) > >For instance, but the best way to understand is to do all the calculations >yourself and try to figure out all the symetries of the board. i wasn't talking about board symmetries - there are none in checkers :-( the question is about using 1 bit per position during generation to represent it's game theoretic value instead of 2 bits. this must be less efficient time-wise, but if you don't have enough memory you have no other option... cheers martin >Good luck and feel free to e-mail me any time on this subject, I did some of the >calculations myself and have some extra's to offer over the Nalimov scheme as >they are at the moment. But I am not into programming these EGTBs at the moment. > >-- >/** > * J.R.Steenhuisen > * Korvezeestraat 329 > * 2628 DP Delft Netherlands > * +31152627758 +31621828440 > * > * Crafty mirror: ftp://anonymous@darkside.its-s.tudelft.nl:21/ > * Chess site: http://darkside.its-s.tudelft.nl/ > */
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.