The integrated AI Review feature for OGS

[Vsotvep]

@flovo

But in that case the move shouldn’t be in the top 3 anyway.

@anoek

Ah yes, that use case. I’ll ponder on that

I thought about it too and came up with this as an algorithm that would not take up more computation and get a better result for the best 3 moves:

Dwyrin is testing the AI / Suggestion for improvement

Ok, let’s try to put it in other words, and describe it as an algorithm: The goal is to find the most game changing move of a finished Go game. First, we compute LZ’s estimate of the board at each position of the Go game, but we let LZ do only a single playout (i.e. it is a very bad guess) Next we compute for each position X of the Go game (except the first position) what the relative winrate is, by computing the difference between LZ’s estimate of winrate for move X and LZ’s estimate of the …

I didn’t test it (I could, if I had time to spare), but I don’t see why it wouldn’t work better than the existing system.