https://github.com/maxleiter/slidingnumberpuzzle

Solve N x N sliding block number puzzles with A*
https://github.com/maxleiter/slidingnumberpuzzle

ai astar-algorithm

Last synced: 3 months ago
JSON representation

Solve N x N sliding block number puzzles with A*

• Host: GitHub
• URL: https://github.com/maxleiter/slidingnumberpuzzle
• Owner: MaxLeiter
• Created: 2017-08-25T18:35:41.000Z (almost 8 years ago)
• Default Branch: master
• Last Pushed: 2017-10-13T03:48:51.000Z (over 7 years ago)
• Last Synced: 2024-10-11T13:20:29.971Z (8 months ago)
• Topics: ai, astar-algorithm
• Language: Java
• Homepage:
• Size: 24.4 KB
• Stars: 2
• Watchers: 4
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# SlidingNumberPuzzle

A basic A* solver for the popular sliding puzzle game.

For solving a game like this

![this](https://sr.ht/KVOp.jpg)

Compile:

`javac *.java`

Usage:

`java SlidingPuzzle --numbers 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,0`

Puzzles can be any `N x N` matrix. No steps are made to check if a puzzle is solvable, so you probably should make sure it's solvable before inputting it. 

Add `--verbose` to print every visited state (even when not part of the solution).

This was made for an Artificial Intelligence independent study for two seniors in highschool. Don't judge too much.

Example:

`java SlidingPuzzle --numbers 5,0,2,8,6,4,7,3,1`