NxM puzzle solver using graph traversal algorithms
-
Updated
Jun 4, 2021 - Java
NxM puzzle solver using graph traversal algorithms
Python script for solving the classic "8-puzzle" game
2D game built with MiniLibX | Map parsing, player movement, collectibles, and sprite animation
Repository for programming project one under ITCS 6150 Intelligent Systems under Dr. Dewan Ahmad for the fall 2021 semester. The aim is to solve the 8-puzzle problem using an A star search algorithm based on the heuristic function chosen by the user. The programming language chosen for this project is Python 3
Add a description, image, and links to the manhatten-distance topic page so that developers can more easily learn about it.
To associate your repository with the manhatten-distance topic, visit your repo's landing page and select "manage topics."