-
Now that I have experience from adding gtests for FastBoard, I would like to add them for FullBoard.
I discovered, while adding tests for FastBoard, that some of the methods (count_pliberties, is_eye…
-
```
Go back through ported code and verify the language correctness and logic
correctness.
```
Original issue reported on code.google.com by `noel.eli...@gmail.com` on 2 Dec 2007 at 8:19
-
I've been using your engine a bunch to compare the output to what mine is doing. In testing a particular endgame position, I noticed an the search was giving the same results after a ucinewgame comman…
-
# Zobrist 算法
Zobrist 是一个快速Hash算法，非常适合用在各种棋类游戏中（事实上也是在各种棋类游戏中有大量应用）。
我们前面讲了负极大值搜索，其实很多时候会有重复的搜索，比如这种：
```js
[7,7],[8,7],[7,6],[7,9]
```
其实它和下面这种的走法只是顺序不同 ，最终走出来的局面是一样的:
```js
[7,6],[7…
-
The implementation of the Hash trait uses only the field 'hash' which is only affected by the pieces positions. On the other hand, the implementation of PartialEq compare all fields of the struct.
Th…
-
Hello!
I found your UHP engine (nice work!), and I ran it through the random rollout move comparison in [my engine](https://github.com/edre/nokamute). You have not implemented the so-called [beetle…
-
Zobrist collisions appear to happen not too often, currently 186 for 27682048. When a collision happens - flag the primary position record with that hash that there is a conflict, and then write that …
-
We should take advantage of itterative deepening by implementing transposition tables (https://chessprogramming.wikispaces.com/Transposition+Table), and thereby improve ordering by first searching the…
-
I am trying to understand how the "board" hashing works in the context of the Jocly chessbase module. This in order to see what I would have to do to update the key for games involving dropping of cap…
-
Use the transposition table to cutoff searches when a results exists at a higher depth. This requires fixing all bugs in the transposition table/Zobrist hashing and storing all alpha/beta/exact evalua…