Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Question about Bit storage

Author: Dann Corbit

Date: 16:28:46 01/30/02

Go up one level in this thread


On January 30, 2002 at 19:11:28, Ricardo Gibert wrote:
[snip]
>>Or (tangentially) alpha-beta files can be created from analyzed chess positions.
>> So that you would know "this position is not worse than..." by doing a lookup.
>>This idea sounds pretty silly (the alpha-beta files) but it might be worth a
>>look in the opening phase or the mid-endgame.
>
>Some of your commentary looks like it was inserted into the wrong post by
>mistake to me. I can't tell if you are agreeing or disagreeing with much of what
>I wrote.
>
>In any case, I would just like to add that the idea of maintaining a database of
>middlegame positions is not reasonable, since the astronomically low hit rate
>does not justify the even tiny amount of time expended trying to look them up.

Exactly.  I agree one hundred percent.  Which is why i said "opening" or
"mid-endgame" instead.  By mid-endgame, I mean a board with perhaps 8-10
chessmen on it.

>Too many possible chess positions and too little memory relatively speaking. Not
>even having 1 position represent an equivalence class of a hundred or so
>positions changes this.

No arguments there.



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.