Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: computer calculations of number of ways to play first 10-ply

Author: Tom Kerrigan

Date: 06:17:42 07/28/98

Go up one level in this thread


I know that the number of 4-ply variations is 206,604 because I use that as a
first sign that my move generator is working correctly.

The 4th root (the approx. branching factor) of 206,604 is 21.31, so the number
of 10 ply variations is ~ 1.931232214271e+13. The real number is probably
actually much higher, because mobility for the first few ply is very limited, so
the branching factor will generally increase as the game goes on.

Assuming this [probably very low] number of positions and the ability to visit
1,000,000 positions per second (a pretty good clip...) it would take about 36
years to visit all of these positions.

In other words, you're not going to get an exact answer anytime soon.

Cheers,
Tom

On July 28, 1998 at 04:17:57, Neil Carlson wrote:

>Please forgive a stranger/beginner if I am breaching any rules of etiquette or I
>missed something in the archives or FAQ (I did look).
>
>Can anyone help or suggest a source for information on the following?
>
>Although computer chess is only effective if the programs focus on the
>"sensible" moves to make in a given position, I'm trying to find out if anyone
>has looked into the question of the huge numbers of ways to play a chess game -
>specifically, the number of ways that the first ten ply (first 20 half-moves)
>can be played; or the possible number of move combinations for a whole game
>(with some kind of sensible limit - 40 or 60 moves).
>
>I thought this might be the sort of thing that could have some significance for
>computer chess, so someone might have done this or know of someone who has.
>
>Thanks for your time and attention,
>
>Neil



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.