Finished
GuillaLeelaguillaume-proven-positions-ungateddiff8.0+0.08LLR: -1.38 (-2.94, 2.94) [0.00, 3.00]
Games: 7692 W: 1830 L: 1884 D: 3978
Ptnml(0-2): 3, 724, 2443, 676, 0
**Disabled the Q-value pinning**. Keep only the quick TB adjudication. Test with 6-man TB.
GuillaLeelaguillaume-proven-positions-ungateddiff8.0+0.08LLR: -1.04 (-2.94, 2.94) [0.00, 3.00]
Games: 5030 W: 1194 L: 1236 D: 2600
Ptnml(0-2): 2, 470, 1613, 428, 2
Testing two changes related to proven or partially proven nodes1. When a node is proven to be at most a draw, cap its Q to 0.02. Before running the NN to compute the value of a position, immediately check if any of its children are adjudicatedIf this proves the position, immediately returnIf this doesn't prove the position, create all terminal children with n_explore = 0 and overwrite FPU with their actual proven value.
GuillaLeelaguillaume-proven-positions-ungateddiff8.0+0.08LLR: 0.20 (-2.94, 2.94) [0.00, 3.00]
Games: 518 W: 120 L: 109 D: 289
Ptnml(0-2): 1, 40, 165, 53, 0
Testing two changes related to proven or partially proven nodes1. When a node is proven to be at most a draw, cap its Q to 0.02. Before running the NN to compute the value of a position, immediately check if any of its children are adjudicatedIf this proves the position, immediately returnIf this doesn't prove the position, create all terminal children with n_explore = 0 and overwrite FPU with their actual proven value.