Thanks to visit codestin.com
Credit goes to Github.com

Skip to content

Tags: bsamseth/Goldfish

Tags

v2.1.1

Toggle v2.1.1's commit message

Verified

This commit was signed with the committer’s verified signature.
bsamseth Bendik Samseth
Bump version 2.1.0 -> 2.1.1

v2.1.0

Toggle v2.1.0's commit message

Verified

This commit was signed with the committer’s verified signature.
bsamseth Bendik Samseth
Bump 2.0.1 -> 2.1.0

v2.0.1

Toggle v2.0.1's commit message

Verified

This commit was signed with the committer’s verified signature.
bsamseth Bendik Samseth
Bump version 2.0.0 -> 2.0.1

Bench: 861138 nodes 2327400 nps 370 ms

v2.0.0

Toggle v2.0.0's commit message

Unverified

This commit is not signed, but one or more authors requires that any commit attributed to them is signed.
Tune speculative pruning margins

Based on ~115k games with the auto tuner. Causes _massive_ pruning
compared to original values. Apparently this is still better than the
inevtibale misses that this induces in the search.

v2.0.0-rc8

Toggle v2.0.0-rc8's commit message

Verified

This commit was signed with the committer’s verified signature.
bsamseth Bendik Samseth
Tune speculative pruning margins

Based on ~115k games with the auto tuner. Causes _massive_ pruning
compared to original values. Apparently this is still better than the
inevtibale misses that this induces in the search.

v2.0.0-rc6

Toggle v2.0.0-rc6's commit message

Verified

This commit was signed with the committer’s verified signature.
bsamseth Bendik Samseth
Reduce history stats impact

Some very light tuning against the starting position, where this seems
to be the optimal multiple of ten in terms of number of nodes visited
when doing a depth 9 search.

v2.0.0-rc5

Toggle v2.0.0-rc5's commit message

Verified

This commit was signed with the committer’s verified signature.
bsamseth Bendik Samseth
Add history heuristic

v2.0.0-rc4

Toggle v2.0.0-rc4's commit message

Verified

This commit was signed with the committer’s verified signature.
bsamseth Bendik Samseth
Use all information when sorting root moves

We only stored the found value when it improved alpha. But regardless of
whether or not it improves alpha, we should keep track of the value so that
when we re-sort the root moves for the next depth, we have all the moves in
the best known ordering.

v2.0.0-rc3

Toggle v2.0.0-rc3's commit message

Verified

This commit was signed with the committer’s verified signature.
bsamseth Bendik Samseth
Add internal iterative deepening

v2.0.0-rc2

Toggle v2.0.0-rc2's commit message

Verified

This commit was signed with the committer’s verified signature.
bsamseth Bendik Samseth
Add futilty, razoring and delta pruning