1
88%
master: 88%

Ran 06 Oct 2021 06:59PM UTC

Files 10

Run time 3s

Badge

Embed ▾

Committed 06 Oct 2021 06:59PM UTC coverage: 89.424%. Remained the same

Job # 478.1

Build Type

push

travis-ci-com

Committed by Adam Stelmaszczyk

Commit Message

Fix the UCT maximization

This fixes a severe bug that was making MCTS + UCT much weaker.

Root player move was corractly taken as:

max(ratio + UCT)

However, for the opponent wrong move was taken:

min(ratio - UCT)

I thought it was doing:

min(- ratio - UCT)

which would be correct.

I also simplified by always taking the max ratio. Negamax trick.
Score is always stored with the respect to the player_to_move.

So e.g. root player has score = 0.7. However on opponent turn
we also want to take max, so want to have score 0.3 (for the same state).
To do this I pass "player" argument to the get_uct function,
to get UCT with respect to that player.

It passes all the units test, it also wins with Minimax(0.1)
when given 10s (does ~70-90k simulations). When given 1s (~7k simulations)
it loses. In 0.1s Minimax looks at ~80k positions, so MCTS is much slower.
There is probably a lot of optimization space in MCTS, e.g. unordered_set.
Also not sure that get_most_visited_move is the best choice, will test that later.

Run Details

761 of 851 relevant lines covered (89.42%)

266659.79 hits per line

AdamStelmaszczyk / gtsa / 478 / 1
88%
master: 88%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 478.1

AdamStelmaszczyk / gtsa / 478 / 1 88% master: 88%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 478.1

AdamStelmaszczyk / gtsa / 478 / 1
88%
master: 88%

README BADGES
x