Ofish-uci-fast

Play against Ofish at lichess.org!

Current features

Negamax search with alphabeta pruning
Basic evaluation (piece values for middlegame and endgame)
Piece square tables (borrowed from PeSTO's evaluation function for middlegame and endgame)
Iterative deepening
Quiscence search limited to depth 2, because it is too slow even at depth 3.. Blame python!
Simple time management mechanism
Communicates in UCI

Name		Name	Last commit message	Last commit date
Latest commit History 25 Commits
build		build
.gitattributes		.gitattributes
LICENSE		LICENSE
README.md		README.md
ofishv1i.py		ofishv1i.py
requirements.txt		requirements.txt
setup.py		setup.py