Computer Chess Club Archives

Search

Messages

Subject: Branching Rate/All reasonable positions

Author: Dustin Moore

Date: 12:44:11 11/26/03

Are there any theoretical numbers on the number of
*reasonable* chess positions availible in a game?

For my purposes a reasonable chess position is one
that could be reached by two good engines looking
out to about to ply 13 or so from a normal opening.

I'm sure someone has written a paper on this at some
point.

I wonder how impossible it would be to make a massive
hash table with all the positions likely to be reached
in a game. I'm wondering just how many hundreds of
TB it would take to store the hash table.

• ~ 10^13 TB !! Bruce Cleaver 08:11:42 11/27/03
  • Re: ~ 10^13 TB !! - much less! F. Huber 10:08:45 11/27/03
    • Re: ~ 10^13 TB !! - sorry: my error! F. Huber 10:32:20 11/27/03
      • Kein Problem!! (NT) Bruce Cleaver 18:29:01 11/27/03
      • Hatte mich schon gewundert k.T. (NT) Olaf Jenkner 13:25:45 11/27/03
        • Re: Hatte mich schon gewundert F. Huber 13:33:13 11/27/03
          • Re: Hatte mich schon gewundert Olaf Jenkner 13:41:59 11/27/03
            • Re: Hatte mich schon gewundert F. Huber 13:59:17 11/27/03
• Re: Branching Rate/All reasonable positions Matthias Gemuh 13:21:25 11/26/03
  • Re: Branching Rate/All reasonable positions Matthias Gemuh 13:27:48 11/26/03
    • Re: Branching Rate/All reasonable positions Dustin Moore 14:35:21 11/26/03
      • Re: Branching Rate/All reasonable positions Dan Andersson 16:17:42 11/26/03
        • Re: Branching Rate/All reasonable positions Duncan Roberts 05:17:53 11/27/03

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.