Author: Uri Blass
Date: 02:19:00 10/20/04
Go up one level in this thread
On October 20, 2004 at 05:11:30, Dieter Buerssner wrote: >On October 20, 2004 at 04:44:44, martin fierz wrote: > >>naah? i think storing the move itself is much more sensible than the moveindex >>and would have supposed everybody is doing the more sensible thing. at least >>crafty does it that way. you can avoid generating all moves at all times, which >>i have to do now. you can check whether the hashmove is valid or not. i can't do >>all that with my stupid moveindex. it saves 2 bytes of course in the hashtable >>entry size, but i don't think that is all-important. what are you doing then? > >It is even less than 2 bytes. For index you need one byte, for a typical move, 2 >bytes is already enough. For example from (6 bit), to (6bit), promotion piece (3 >bit). promotion is only 2 bits. I also did the error of thinking that it is 3 bits but you only need to distinquish between different promotions when promotion is possible and the information when promotion is not possible is not important as long as it is the same. 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.