https://github.com/puemos/reasonml-astar-maze

A-star search algorithm written in ReasonML
https://github.com/puemos/reasonml-astar-maze

Last synced: about 2 months ago
JSON representation

A-star search algorithm written in ReasonML

• Host: GitHub
• URL: https://github.com/puemos/reasonml-astar-maze
• Owner: puemos
• License: apache-2.0
• Created: 2018-05-21T05:18:23.000Z (about 6 years ago)
• Default Branch: master
• Last Pushed: 2018-06-09T09:03:37.000Z (about 6 years ago)
• Last Synced: 2024-04-14T22:57:57.612Z (3 months ago)
• Language: OCaml
• Homepage: https://puemos.github.io/reasonml-astar-maze
• Size: 4.3 MB
• Stars: 38
• Watchers: 3
• Forks: 2
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Lists

• awesome-list - reasonml-astar-maze - star search algorithm written in ReasonML | puemos | 39 | (OCaml)
• awesome-reasonml - A* pathfinder maze - A* search algorithm written in ReasonML [(demo)](https://puemos.github.io/reasonml-astar-maze) (Reason / Example Apps)
• awesome-reasonml - A* pathfinder maze - A* search algorithm written in ReasonML [(demo)](https://puemos.github.io/reasonml-astar-maze) (Reason / Example Apps)

README

        
[Reason A* Pathfinding maze](https://puemos.github.io/reasonml-astar-maze/)

=============

Reason A* Pathfinding maze is an web-browser implementation of A* path finding algo written exclusively in ReasonMl.

![Gameplay preview](https://j.gifs.com/9Qz6LZ.gif)

[Try it out!](https://puemos.github.io/reasonml-astar-maze/)

## Key Features

* Perform a search and find the shortest path between all the food points

* Edit the maze

## Roadmap

* Move the search module to a web worker

* Improve the ui

* Be able to edit the maze dimensions

## [Description](https://en.wikipedia.org/wiki/A*_search_algorithm)

> In computer science, A* (pronounced as "A star") is a computer algorithm that is widely used in pathfinding and graph traversal, which is the process of plotting an efficiently directed path between multiple points, called "nodes". It enjoys widespread use due to its performance and accuracy. However, in practical travel-routing systems, it is generally outperformed by algorithms which can pre-process the graph to attain better performance,although other work has found A* to be superior to other approaches.

## Modules

* **Game**

* **Search**

* **Animation**

* **Components**

## Building the Project

1. `npm install`

2. `npm start`

## Contributing

Pull requests fixing bugs, adding functionality, or improving organization are welcome!

## Authors

* Shy Alter ([@puemos](https://github.com/puemos))