Skip to content

Version 1
Compare
Choose a tag to compare
@Vianpyro Vianpyro released this 09 Sep 15:52
· 9 commits to main since this release
v1
88d5468

Release Version 1: Initial Release with Optimized BFS Solver

I am excited to announce the first official release of the 8-Puzzle Solver project! This release includes a working implementation of the 8-Puzzle solver with a focus on optimizing the Breadth-First Search (BFS) algorithm.

Highlights

  • Optimized BFS Algorithm: The BFS algorithm has been enhanced with a HashSet to improve performance by avoiding redundant state exploration. This optimization helps in reducing the time complexity and makes the solver more efficient in finding the solution.

Features

  • "Efficient" BFS solver with HashSet-based optimization

How to Use

  1. Compile the Project: Use GCC or the provided Makefile to compile the solver.

  2. Run the Solver: Execute the compiled binary.

  3. Experiment: Test the solver with various 8-puzzle configurations and observe...

Future Plans

Future updates will focus on optimization, command-line arguments for mode, adding heuristic functions, adding additional solving algorithms, and improving user experience.

We appreciate your interest in the 8-Puzzle Solver project and encourage you to contribute by providing feedback or reporting issues.

Full Changelog: https://github.com/Vianpyro/8-Puzzle_Solver/commits/v1

Assets 4
Loading