KO | EN

GitLite

Minimalist Open Source Repository Search Engine

gitlite — search

#dsh #dsh-plugin #developer-tools #ai-agent #claude-code #codex #typescript #ai-agents #deepseek-harness #mcp #cli #rust

n-puzzle

★ 48 Open GitHub ↗

Single-page web app for learning about graph search algorithms, such as Depth-First Search and A* Search

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# N-Puzzle

N-Puzzle is a web app for learning about graph-based search algorithms.

![Screenshot](https://raw.githubusercontent.com/tristanpenman/n-puzzle/master/doc/screenshot.png)

We use the 8-puzzle, an instance of the [Sliding Puzzle](https://en.wikipedia.org/wiki/Sliding_puzzle) problem where eight tiles are placed on a 3x3 grid. The remaining position is an empty space. Tiles adjacent to the empty space may be moved into that space. The puzzle is solved by finding a sequence of moves (state transitions) that will allow us to move from the initial state to the goal state.

An example initial state and goal state are given below.

**Initial state**:

2 3 -
    4 5 1
    6 7 8

**Goal state**:

2 5 3
    4 7 -
    6 8 1

## Algorithms

N-Puzzle provides five algorithms that can be used to solve the problem:

- Breadth-first Search (BFS)
- Depth-first Search (DFS)
- Iterative Deepening DFS (ID-DFS)
- Greedy Search
- A* Search

Since Greedy Search and A* Search are informed search algorithms, three heuristic functions are also provided:

- Euclidean distance heuristic
- Manhattan distance heuristic
- Tiles-out heuristic

## Demo

A live demo is available [here](http://tristanpenman.com/demos/n-puzzle).

## Development

N-Puzzle has been built using JavaScript [Vue.js](https://vuejs.org/) framework, using Vue [Single File Components](https://vuejs.org/guide/scaling-up/sfc.html).

The project now uses [Vite](https://vitejs.dev/) for local development and builds. The instructions below assume you are using [pnpm](https://pnpm.io/) package manager.

To run the dev server:

pnpm install
    pnpm run dev

Vite will print the local URL (typically http://localhost:5173) in the terminal. If you change any of the code, simply refresh the page to see your changes.

To build a production version:

pnpm build

You can also preview the production build locally:

pnpm preview

## Acknowledgements

N-Puzzle is based on the AI-Search Java applet developed at RMIT University by Vic Ciesielski, James Harland and Peter McDonald.

The original applet can found on RMIT's [AI-Search website](https://learninglab.rmit.edu.au/Toolbox/AI-Search/index.html).

## License

This project is distributed under the 3-Clause BSD License. See the LICENSE file for more information.

n-puzzle

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README