Author: Gian-Carlo Pascutto
Date: 01:26:55 09/18/04
Go up one level in this thread
On September 18, 2004 at 03:39:00, Gerd Isenberg wrote: >About the Issue "Parallel Chess Searching with Bitboards", i have the same >problem as others to get David's point, what makes the board representation or >it's additional size of 17 bitboards so unique while splitting nodes? This *is* explained in the paper: more overhead on a split. (I don't really agree, btw ;-) >What is the difference between David's lockless hashing approach and Bob >Hyatt's? Isn't it the same xor idea? >http://www.cis.uab.edu/hyatt/hashing.html It's the same (and it's properly attributed). -- GCP
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.