Skip to content

Near-Uniform Random Openings #44

@shindavid

Description

@shindavid

Implement the following idea from Appendix D of the KataGo paper:

In 5% of games, the game is branched after the first r turns where r is drawn from an
exponential distribution with mean 0.025 ∗ b^2. Between 3 and 10 moves are chosen uniformly
at random, each given a single neural net evaluation, and the best one is played. Komi is
adjusted to be fair. The game is then played to completion as normal. This ensures that
there is always a small percentage of games with highly unusual openings.

Some thought is needed on how to generalize this for games besides go. The komi-adjustment in particular has no clear analog in other games. It might be the case that there is no good way to generalize this.

Metadata

Metadata

Assignees

No one assigned

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions