@@ -34,18 +34,26 @@ import (
34
34
// MTD(f)
35
35
// MTD(bi)
36
36
37
- 50 move rule.
38
- Insufficient material.
39
- Opening book analysis. (fuck)
40
- Lines via linked list.
41
37
PSTO evaluation.
42
38
Tapered eval
43
39
Endgames
40
+ 50 move rule.
41
+ Insufficient material.
42
+ Opening book analysis. (fuck)
44
43
Better move ordering.
45
44
SEE
46
45
History heuristic
46
+ Internal iterative deepening
47
+ Quiescence check escapes.
48
+ Fix Zobrist castles and en passant
49
+ Mate distance pruning
50
+ Root PVS
51
+ Aspiration window
52
+
47
53
Parallel search via LAZY SMP
48
54
55
+ Lines via linked list.
56
+ Build PVS to benchmark.
49
57
Investigate 0.3.1 beating 0.3.4 in performance. Probably just hashing slowdowns from static?
50
58
Make total nodes trustable. Local tracking.
51
59
@@ -109,14 +117,14 @@ func main() {
109
117
out ("Running main program." , "\n " )
110
118
defer exit ()
111
119
112
- inner := new_engine_0dot4dot1 ()
113
- engine := new_engine (& inner , 1 , nil )
114
- simple_tests (engine )
120
+ // inner := new_engine_0dot4dot1()
121
+ // engine := new_engine(&inner, 1, nil)
122
+ // simple_tests(engine)
115
123
// eigenmann_tests(engine)
116
124
117
125
// mini_performance_challenge()
118
126
// mini_test_transposition()
119
- // mini_self_challenge()
127
+ mini_self_challenge ()
120
128
// mini_challenge_stockfish()
121
129
}
122
130
@@ -150,10 +158,10 @@ func mini_performance_challenge() {
150
158
151
159
func mini_self_challenge () {
152
160
game := game_from_fen (CHESS_START_POSITION )
153
- engine1 := new_engine_0dot4dot0 ()
154
- wrapped1 := wrap_engine (& engine1 , 5 , game )
155
- engine2 := new_engine_0dot4dot1 ()
156
- wrapped2 := wrap_engine (& engine2 , 5 , game )
161
+ // engine1 := new_engine_0dot4dot1 ()
162
+ wrapped1 := wrap_engine (& engine_0dot3dot4 , 5 , game )
163
+ // engine2 := new_engine_0dot4dot1()
164
+ wrapped2 := wrap_engine (& engine_0dot2dot1 , 5 , game )
157
165
challenge_self (wrapped1 , wrapped2 , game )
158
166
}
159
167
0 commit comments