> Yep. > I'm thinking about implementing it in libego with heavy playouts for > demonstration. > Maybe It will get libego some attention. :)
Thanks for your answers. I'm impressed with the speed of your library. > I use zobrist hashing as well. But the random base is separated from > board and shared so I don't copy it. > I copy just a xor hash which is no more than 8 bytes per board. I have an array that stores for each position and color combination a random ushort (2 bytes). It is global. Also every board has its own hash which is derived from all the positions/colors that have been played xored into it. So I think it is similar to yours in these aspects. What I don't understand is: How do you know from just a single xor hash if you have played a certain position/color before? Don't you somehow have to store for each possible hash (which is 2 bytes in my example) if it has been used before? The amount of possible hashes even for 2 bytes is quite large. -ibd -- Neu: GMX FreeDSL Komplettanschluss mit DSL 6.000 Flatrate + Telefonanschluss für nur 17,95 Euro/mtl.!* http://dslspecial.gmx.de/freedsl-surfflat/?ac=OM.AD.PD003K11308T4569a _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
