[Welcome to Sensei's Library!]

StartingPoints
ReferenceSection
About


Referenced by
ComputerGoProgram...

 

Playout Analysis
    Keywords: Software

What is better for programming Go ?

A brief description of Playout Analysis:

Place the stone on the board you want to find the value for. This is now your beginning board position.

Play a series of random moves (presented from a move generator) from your beginning board position. Evaluate the board. Return to the beginning board postion and repeat the play of series a dozen times, summing the board evaluations.

Go back to the initial board, and place a new stone, then do the play a new series from that position, and again for the next stone, and again, and again....

Find the stone that had the best sum. Play this move.

JG There was some discussion on Playout Analysis in the computer go mailing list starting in August 2004. See the messages about SlugGo? in [ext] http://computer-go.org/mailman/listinfo/computer-go/

Bill: I would think that there need not be a requirement for random play. If you want no search at all, you could still use heuristics, which should produce a better result than random play.



This is a copy of the living page "Playout Analysis" at Sensei's Library.
(OC) 2004 the Authors, published under the OpenContent License V1.0.