Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Question about Bit storage

Author: Dann Corbit

Date: 11:41:52 01/30/02

Go up one level in this thread


On January 30, 2002 at 08:58:25, Vincent Diepeveen wrote:
[snip]
>In fact these guys will never be able to generate an EGTB themselves,
>something real simple they invent new terms for and conclude that chess
>is just 2^81 + 2^3.5 positions, so before they can generate a 5 men
>themselves they will need to work for another 100 years and also
>will invent that you can reduce many positions by removing illegal
>positions. That will be named of course 'cutting the universe' then,
>not removing simply removing illegal positions as we all call it :)

Hah!  This from the guy who thought he made crafty play exactly like Deep Blue!
;-)

They aren't really tablebase files anyway.  They are approximations to them
only.  They don't give a best move.  Instead, they give a winning move or a
drawing move.  But not necessarily the shortest one.  They would be (depending
on the type and number of pieces) much smaller than Nalimov tablebase files.

You don't believe that, which is fine.  But it's a fact.



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.