-
-
Add position caching, so that positions that have already been evaluated do not need to be evaluated again. This will result in large performance gains, especially since Negamax uses iterative deepeni…
-
## Assignment
Write a tic tac toe game as described here: https://github.com/TIY-ATL-ROR-2015-Sep/lectures/blob/master/wk01-ruby-basics/thu/questions.md
## Submission
Post your code as a gist and le…
-
Hi there!
I'm stockfishdeveloper and you contacted me about assisting me with the engine. Are you still interested?
stockfishdeveloper(David)
-
Progress:
- [x] Split
- [x] Objectives
- [x] Join
- [x] Main thread
## Split
- When an objective is chosen, check three nearest objectives from it
- If us > max(nb_obj, max(nearest_nb) - nb_obj)), cre…
-
In the future, we'll want to consider this and how it can be done. Will be interesting to try. Another consideration is the cloud ;)
-
I'm still not convinced that pruning is working exactly how it should. Mainly because of how much negative numbers come up. Immediately at the start of the game it seems white is in the negative. This…
-
These tend to come up often. Not sure what is the cause of these. Either NegaMax is not coming up with any moves for some reason, or the move generation is making it a thing. Its also possible ghost p…
-
-
Just reminding myself, to fix bugs in 7b0c3559ff1fb62475714cbc8bfa085b0ad3121d
Wikipedia [Negamax](https://en.wikipedia.org/wiki/Negamax)
Basically uses `max(a, b) = -min(-a, -b)`
```
function nega…