Sliding Tile Race

Challenge an AI to a turn-based race to finish a sliding tile puzzle. Options include choosing between a 3x3 or 4x4 grid, as well as adjusting AI difficulty, with difficulty options changing how likely the AI is to make the correct move to solve the puzzle.

Made for CS 491 AI in Games Assignment 1. The assignment's goal was to implement an uninformed search algorithm to solve the 15-puzzle, a 4x4 sliding tile puzzle. For my implementation, I used a Breadth-First Search algorithm.

A major design constraint found in development was needing to have a low number of initial puzzle shuffles due to space complexity needed for the breadth-first search.