Skip to content

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 compentenc…

Notifications You must be signed in to change notification settings

BeeGass/AI-Project2

Repository files navigation

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.

Instructions to run the program: COMING SOON

About

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 compentenc…

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages