-
Ability to save/load leela search tree would help in researching leela's MCTS and identifying possible bugs/blind spots in the search algorithm. It seems that sometimes the node with higher Q value do…
-
Sorry this is not a real issue. There is no forum for this project, I don't know better way to talk to you ;)
FYI, I wrote 2048 ai last year, too. https://github.com/kcwu/2048-c
I used many similar i…
-
are you guys still accepting pull requests?
-
hi davidstone,
i saw you used minimax / alpha-beta-pruning for your ai.
the problem: pokemon is not an sequential game, where both players do their moves alternating, it is an simultaneous-move gam…
-
Saving the results of iterative deepening in a single static variable might lead to a race condition where the result of an old calculation overwrites the result of the new calculation.
My suggestion…
-
Hey, mate! Came across your work on a MCTS implementation for quoridor and thought it was very impressive. I'm trying to become a quoridor expert this year and I think an AI tool could be very helpful…
-
## *Repository Creation Request*
Use this to get your experiment repository created or updated on GitHub under Virtual Labs organization.
1. #### Coordinating Institute:IIIT-H
2. #### Approver’…
ghost updated
2 years ago
-
I removed it because there were some issues with the whole pruning logic but it's now time to add it back!
The DP should look like this:
```
unordered_map dp;
```
And let's make sure we treat c…
-
For even/odd functions using the respective type of polynomial typically allows for much higher degree approximations. Would it be relatively easy to add the ability to generate a minimax polynomial w…
-
Hello, and thanks for trying out my minimax library! You're the third one including me so please let me know how it can be improved :)
I see a couple of issues with how your game is implementing th…
edre updated
9 months ago