Tool that can solve random or given n-puzzles (n=8, 15, 24...) using the A* search algorithm and return stats on the solutions.
This is a Typescript port of it's python based sibling for python's lack of cumputing speads when dealing with large amounts of memory.
- Displacement
- Manhattan Distance
- Out Of Row Coloumn
- Linear Conflict
- Euclidean
- Clone the repository and install NodeJS
- Run
npm install
to install dependencies - Run
node ./build/index.js
to execute program - Make any changes to
index.ts
and runtsc
to build them
MIT © License can be found here.