What is the scoring rule you used for achieving your scores now? Is it (n-2)^2 ? If so, then congratulations on a higher score then my program.spurious_ai wrote:I still have some adjustments to my program and believe I can find a higher score. The biggest problem is the 2 block move. Under the scoring used for this version of SameGame, (n-2)*(n-2), a 2 block move scores 0 points.
Could the 0 point move cause a problem in their MC implementation? Should have I been able to beat their score?
Yes, it is true, my program clears the complete board on all the 20 positions, so the penalty at the end is indifferent.
About the 0 score move, I do not see why this move forms a problem in my implementation. The program regularly uses these moves to form larger groups. The big problem with my implementation, and probably the biggest point of improvement is the random playout strategy. As you can see in my paper, I choose the color with the most blocks on the board (One position nr.1 red) and do not play it at all in my random games until not possible otherwise. Like this large groups are formed automatically. The problem is now, that before the big group is removed, a lot of unnecessary moves are played, just to avoid playing the red group. This is where points get lost.
I would be interested in your method that you use. Do you have any information for me on that? Thx.