These projects were made for my AI in Games class in my Spring 2023 semester at UNR. They are not the most efficient games, but provide a good demonstration of the relevant AI.
My final project for this class, a simple RTS demonstrating pathfinding and basic behavior tree logic
This project is a demonstration of A* and Potential Field pathfinding in various environments.
A demonstration of minimax search AI (with alpha-beta pruning). This is a themed take on the board game Connect Four by Hasbro. The player and AI take turns dropping colored chips down vertical shafts. The first player to get four in a row horizontally, vertically, or diagonally is the winner
A demonstration of an uninformed search algorithm AI. This is a sliding tile puzzle game where the player takes turns against an AI opponent to finish their puzzle before the opponent. The AI uses a Breadth First Search tree algorithm to find the most efficient path to complete the puzzle.
