Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Computational question for mathematicians, philosophers & computer-geeks

Author: Jay Scott

Date: 12:33:02 03/03/05

Go up one level in this thread


The number of bits required to store a chess position is exactly ceiling (log2
(number of chess positions)). log2 means log base 2. ceiling means round up.
Then each chess position can be given its own binary number with no conflicts.



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.