-
I would like to have some help adjusting possible_moves(self) and make_move(self,move) se…
-
```
xyene@lycan:~/chess$ make
mkdir obj
g++ -Wall -std=c++11 -g -c -o obj/zkey.o src/zkey.cc
g++ -Wall -std=c++11 -g -c -o obj/transptable.o src/transptable.cc
g++ -Wall -std=c++11 -g -c -o obj/b…
Xyene updated
7 years ago
-
Following the documentation at:
http://zulko.github.io/easyAI/get_started.html#human-and-ai-players
Adding `tt=table` to Negamax, where `table` that is an instance of `DictTT` results in:
…
-
I wrote a less-recursive version yesterday (recursive but uses less stack space) and got a 400% performance improvement. Inspired, I've started writing a fully non-recursive stack-free version. Essent…
-
@Zulko
It is fairly common for a some of the possible moves to have an equal score at the end. I believe the current algorithm simply chooses the first best selection. But often, from a strategic …
-
Determinism is nice for testing and proving mathematical formulas. However, as far as playability goes, it proves to be quite boring for a human player. Always responding with the same move when given…
-
Hi.
Is it possible to configure the game with the oponent being a robot ?
thanks
-
```
Implement Negamax Search.
Algorithm:
(Set depth initially to required value)
SEARCHING_FUNCTION {
Decrease depth by 1
Loop through all moves
Play move
if ( depth = 0 ) move_scor…
-
Negamax is getting the list of legal moves from GameState, but is not using Evaluator to sort them.
-
Minimax:
- initial node
- current player
- depth, nullable
- heuristic: node - - > [number]
Return: (action, number)
In lib/algorithms
fpoli updated
9 years ago