Author: Russell Reagan
Date: 13:59:04 04/06/03
Go up one level in this thread
On April 06, 2003 at 16:18:29, Dieter Buerssner wrote: >Let's start even easier - with only 2 kings. In your scheme, it will be 64*64 >positions. But we can try to enumerate all legal king king positions. It turns >out, that there are only 3612 such positions (instead of 4096 = 64*64). It is >easy to store a table for this. Something like kingindex[64][64]. >kingindex[a1][a1] could be -1. kingindex[a1][b1] = -1; kingindex[a1][c1] = 0; >kingindex[a1][d1] = 1; and so on. Ah, an intermediate table. Is where the huge memory requirement comes from when generating larger tablebases? Also, I'm not sure where the Godel number is used. Is it used as an index into this kind of array (only 1D instead of 2D)? Thanks for your response. I must let it "sink in" :) Russell
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.