Skip to content
This repository was archived by the owner on May 17, 2023. It is now read-only.
/ comp472-project2 Public archive

A program designed to solve a Rush Hour puzzle through various different algorithms (Uniform Cost Search, Greedy Best First Search, Algorithm A/A*) and return the results. This was built as part of COMP 472.

Notifications You must be signed in to change notification settings

sobhan-m/comp472-project2

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

84 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

https://github.com/sobhan-m/comp472-project2.git

Description

This repository includes all the work related to project 2 of COMP 472 in Fall 2022. The project involves solving a modified Rush Hour game using different search algorithms, namely Uniform Cost Search, Greedy Best First Search, and Algorithm A/A*.

Group Detail

  • Name: Deus Ex Machina
  • Team Member(s): Sobhan Mehrpour Kevishahi

Running The Project

To run the project, simply open project.ipynb and run all cells. This requires Python 3.8 or above.

You can test the program using

python -m unittest

Results

You can find both csv and Excel files in output/. You can read the detailed analysis within project.ipynb itself.

About

A program designed to solve a Rush Hour puzzle through various different algorithms (Uniform Cost Search, Greedy Best First Search, Algorithm A/A*) and return the results. This was built as part of COMP 472.

Topics

Resources

Stars

Watchers

Forks