[ View Thread ] [ Post Response ] [ Return to Index ] [ Read Prev Msg ] [ Read Next Msg ]

BGonline.org Forums

Do you know the definition of "solved"?

Posted By: eXtreme Gammon
Date: Thursday, 7 April 2011, at 5:38 p.m.

In Response To: Do you know the definition of "solved"? (LowRayTeeng)

LowRayTeeng i'm guessing "existing hardware" is more than capable of creating a "huge pre-generated database" but this effort has not been done yet, probably because lack of popularity, which is a different issue

No, existing hardware is far from being able to solve backgammon.

The number of positions is 18,528,584,051,601,162,496 ( http://www.bkgm.com/rgb/rgb.cgi?view+371 ) and that's whitout the cube.

Traversing the tree will had many factor of magnitude. For instance in checkers the number of position is 10^20 and the tree is 10^31 ( http://en.wikipedia.org/wiki/Checkers#Computational_complexity )

But let just say only 4 (x10000). But just assume that it take a mere 100 operations (Gross underestimation, Xg is doing about 60,000 ops per position) to determine the value of the position. That means 1.85*10^25 ops to execute

the faster computer is NUDT YH Cluster ( http://en.wikipedia.org/wiki/TOP500 ) with a speed of 2566.00 TFlops. It will "only" take it 229 years.. and that's only for cubeless backgammon. Multiply by 3 for cubefull money and 141 for all score up to 11 point match (total time, 32972 years)

I do not think it qualifies a resonable amount of time!

Messages In This Thread

 

Post Response
Your Name:
Your E-Mail Address:
Subject:
Message:

If necessary, enter your password below:

Password:
 

 

[ View Thread ] [ Post Response ] [ Return to Index ] [ Read Prev Msg ] [ Read Next Msg ]

BGonline.org Forums is maintained by Stick with WebBBS 5.12.