Author: Inmann Werner
Date: 02:00:53 11/10/99
Go up one level in this thread
On November 10, 1999 at 04:12:01, Bas Hamstra wrote: >It is also fine because you can see very fast if a piece (pseudo-) attacks >another piece, without scanning squares. You can do that by square relationship >testing and it is very fast. > >Just subtract two squares, add an offset and lookup the result in a simple >array. > > >Regards, >Bas Hamstra. > > Hello Bas! Interesting. Can you explain that "substract" thing a little to me. Seems very interesting and maybe useful to me. What about sliding figures with something between ... I tried much aroun at that problem but still not really happy.... Spend to much time in check detection in my program.... Werner
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.