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

BGonline.org Forums

N-ply Algorithm

Posted By: eXtreme Gammon
Date: Sunday, 23 January 2011, at 1:37 a.m.

In Response To: Containment: Might 7-ply outperform XGR+? (Rich Munitz)

The N-ply Algorithm is pretty straight forward:

  • for each 21 dice
    • check if player should double (using N-ply) and move the cube position
    • if N=1

      • Get the cubeless equity from the NN

      • convert to Cubeful using Janowski formula
    • Else

      • get the best move using a 1-ply

      • make the move selected

      • do a (N-1)-ply evaluation of the resulting position
  • accumulate the resultat weighing them (1/36 for double, 2/36 otherwise)
  • return to caller

So yes, a 7-ply will check all 21^6=85,766,121 dice possible.

Compared to XGR+ it makes move decision in 1-ply rather than 2-ply, which is a minus, but on the plus side it does the does not do a sampling of the position like the RO in XGR+ does.

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.