Skip to content

Latest commit

 

History

History
52 lines (34 loc) · 1.7 KB

README.md

File metadata and controls

52 lines (34 loc) · 1.7 KB
Raw

BSV_15

Branch and Bound algorithm for solving the 15-Puzzle

Description

This is a simple implementation of the Branch and Bound algorithm for solving the 15-Puzzle. The algorithm is implemented in Python and uses the following libraries:

Installation

To install the required libraries, run the following command:

pip install -r requirements.txt

Usage

To run the program, run the following command from the program's root directory:

python3 main.py

Options

The program has the following options:

  • 1. Launch GUI: Launches the GUI, allowing user to interact with the puzzle and solver.
  • 2. Plot Timing Data: Gathers and plots experimental timing data for the solver. The results are stored as .csv files in the dataframes directory. The plots are stored in the plots directory.
  • 3. Import Test Puzzle: Imports a test puzzle from the test_boards directory. The puzzles are stored as a grid of whitespace separated integers in .txt files.

Authors