Skip to content

A simple, interactive web-based demonstration of the A* pathfinding algorithm in a grid-based RPG-like environment. This project visualizes how A* efficiently finds the shortest path between two points while avoiding obstacles, simulating character movement in a 2D game world.

License

Notifications You must be signed in to change notification settings

lemmski/astar-rpg-pathfinding-demo

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 

Repository files navigation

A* RPG Pathfinding Demo

This project demonstrates the A* pathfinding algorithm in a simple, grid-based RPG-like environment. It provides an interactive web interface where users can set start and end points, create obstacles, and visualize how the A* algorithm finds the optimal path.

Features

  • Interactive 20x20 grid
  • Set start and end points
  • Create and remove obstacles
  • Visualize the A* algorithm's path-finding process
  • Simple and intuitive user interface

How to Use

  1. Clone this repository
  2. Open index.html in a web browser
  3. Click to set the start point (green)
  4. Click again to set the end point (red)
  5. Hold Ctrl and click to add or remove obstacles (black)
  6. Click "Find Path" to run the A* algorithm
  7. Click "Reset" to clear the grid and start over

Technologies Used

  • HTML5
  • JavaScript
  • Canvas API

Contributing

Contributions, issues, and feature requests are welcome! Feel free to check the issues page.

License

This project is MIT licensed.

Author

Aleksi Lemmetyinen


Happy pathfinding!

About

A simple, interactive web-based demonstration of the A* pathfinding algorithm in a grid-based RPG-like environment. This project visualizes how A* efficiently finds the shortest path between two points while avoiding obstacles, simulating character movement in a 2D game world.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages