Author: Dan Andersson
Date: 17:37:36 07/17/00
Go up one level in this thread
I think we misunderstand each other. I'm not talking about hashing the whole position. You only need to have a function that calcuates the difference between a piece position when you make that move, and its original position(in the first non reversible position),no big thing. Thats a cheap and incremental way of doing this, as long as you don't have a Transposition table. What you are looking for is some function g(f) that knows if f(p0)=f(pn) or f(pm)=f(pn) when m<n now you only need to apply group theory to see if there is such a function. But remember Gödels theorem.
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.