Author: Reinhard Scharnagl
Date: 23:39:16 03/02/05
Go up one level in this thread
On March 03, 2005 at 01:25:55, Les Fernandez wrote: >On March 03, 2005 at 01:09:27, Reinhard Scharnagl wrote: > >>On March 02, 2005 at 18:59:18, Axel Schumacher wrote: >> >>>... >>>1. For each data-point (e.g. let's say the position of a pawn on the chessboard) >>>one requires 1 bit (either 0 or 1). Right? However, the information does not >>>include where the pawn is located. So, how much data has to be stored to >>>describe e.g. the position of a pawn? >>>... >> >>See at http://www.chessbox.de/Compu/schachzahl1b_e.html where it is shown, that >>in average there is a limit of 164 bit to store a complete 8x8 board situation. Hi Les, >I dont know if there is any interest in the following but I am curious to know >your opinions. First let me say that somewhere in the past I remember someone >saying that if given 100 yes and no questions that the actual board positions >could be created. If anyone remembers this and perhaps a link to it I would be >interested in reading up on it. there might be possibilities to store chess positions in some few less bits if always THE COMPLETE PIECESET is used for both sides. But I hardly could imagine that 100 bits should be sufficient even then. >Now for my $.02. Does anyone see any benefit if I told you that I can store an >entire chess position (piece type, color, location, ep, castling, stm, pv a,d >ce) in a way that I can average approx 15-20 bits per position with one >criteria. That criteria is that the position must be a proven mate. As long as >it is a proven mate it makes no difference if there are 3 pieces or 32 pieces in >the sense of arriving at the above reported average bits. Event that restriction seems not to be sufficient for to make your claim valid. >Does anyone think there is a use for something like this? I don't know. I personally have no need for this. Reinhard.
This page took 0.01 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.