Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Algorithm for Encoding Any Position in 155 bits (part 1/2)

Author: Ratko V Tomic

Date: 06:21:18 11/15/99

Go up one level in this thread


Errata 1:

> Decoding of I(S1,..,SM) works by finding x for the largest {x;M} < I,
..
> Searching for {x;M}<I we use in decoding involves a short binary search

The {x;M}<I should be in both instances {x;M}<=I (in other instances of this
inequality, the correct <= was written, or the descriptive phrase "not
exceeding" was used for it, which is the correct description of the <=
operator).



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.