-
Notifications
You must be signed in to change notification settings - Fork 0
/
TODO
23 lines (20 loc) · 883 Bytes
/
TODO
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
MCTS:
- Use better random generator maybe from statistics, mersenne-random package or
Xorshift package.
- Try All-Moves-As-First Heuristica (from Bernd Brugmann. Monte carlo go. Technical report, 1993.)
AlphaBeta:
- Add Quiescence search.
- Add proper History heuristics.
- Analyse/repaire Null Move.
- Try different parallelize model.
General:
- There may be problems on computers with 64bit architecture -> test/fix.
- Prevent lost due to third time repetition rule.
- Support full AEI protocol.
- Improve evaluate function! (And maybe GoalCheck too)
- Add Board::trapCheck from Akimot?
- Try use Vector instead of Lists in basic representations and/or better Array
library (http://www.haskell.org/haskellwiki/Arrays).
- Better collision handling in Hash library.
- Find faster HashTable library.
- Rewrite BoardToCode using general haskell parser (to improve readability).