Updated 5 months ago
https://github.com/beegass/ai-project2
In the class CS-4341, Artificial Intelligence, we were tasked to build an agent that could play the game of Gomoku. In order to achieve this the team implemented the MiniMax algorithm, Alpha-beta-pruning as well as our own understanding of evualtion function to facilitate the previous two algorithms. Additionally to aide in the agents compentency the team built, from scratch, a linear neural network.
Updated 6 months ago
moonfish
Didactic Python Chess Engine that implements: Negamax, PeSTO’s Evaluation, Null Move, Quiescence Search, Lazy SMP.