-
Notifications
You must be signed in to change notification settings - Fork 51
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
How to Generate Good Opening Book #14
Comments
I just stumbled accross this issue. John Tromp already computed a 8-ply database long ago and I also computed a 12-ply database some years back: https://github.com/MarkusThill/Connect-Four |
The opening book is stored in a TranspositionTable in which new insertions override previous positions having the same hash. To keep the most useful position in a fixed size opening book I used the following heuristic: sort the position per number of explored node to solve before inserting them into the opening book. The last inserted positions are more likely to be kept in the opening book. These are the most complex and the most time consuming positions to solve. It will save you a lot of time to avoid full computation. |
When i try to download the opening books here https://github.com/MarkusThill/Connect-Four/tree/master/CFour/src/openingBook |
How did you generate your opening book?
The bigger is only 32MB, dose it enough?
What are the rules for selecting positions?
The text was updated successfully, but these errors were encountered: