Skip to content
#

manhattan-distance

Here are 109 public repositories matching this topic...

The classic 8-Puzzle challenge: Human vs. AI! This project features an AI solver (Best-First Search with Manhattan distance) and a Tkinter GUI that visualizes its steps. A volunteer can initialize the AI solver alongside a human's manual attempt. The "Stop" button allows the volunteer to declare the human the winner if they solve it before the AI.

  • Updated Apr 19, 2025
  • Python

This Java-based GUI program lets users generate and solve mazes. It employs the Depth-First Search (DFS) algorithm for maze generation and A* algorithm with Manhattan distance heuristic for solving. The program provides a visual representation of the maze, allowing users to visualize the process of maze creation and solving.

  • Updated Jun 13, 2024
  • Java

Improve this page

Add a description, image, and links to the manhattan-distance topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the manhattan-distance topic, visit your repo's landing page and select "manage topics."

Learn more