Source:
Nvidia
https://github.com/smatovic/Zeta/tree/zeta_nvidia_0920
AMD
https://github.com/smatovic/Zeta/tree/zeta_amd_0920
Changes:
- one thread handles one board
Still Missing:
- castle moves
- en passant moves
- checkmate detection
- Quiscence Search
Zeta 0.920 uses one thread to compute the tree of one chess position.
Performance:
This design makes about 10 000 nps per Thread, with currently only one thread running.
Search depth 5 with AlphaBetaPruning and MoveOrdering:
nodes: 16875 ,movecount: 73700,sec: 1.820000
nodes: 54307 ,movecount: 260524,sec: 4.400000
nodes: 97125 ,movecount: 624798, sec: 8.410000
nodes: 113395 ,movecount: 1038605, sec: 10.530000
Outlook:
Next topic would be to build a load-balancing mechanism.
--
Srdja
0 Kommentare:
Post a Comment