https://github.com/bb4/bb4-a-star

Scala implementation of generic A-Star search algorithm using a mutable priority queue as described in Algorithms by Robert Sedgewick.
https://github.com/bb4/bb4-a-star

algorithm optimization scala

Last synced: 3 days ago
JSON representation

Scala implementation of generic A-Star search algorithm using a mutable priority queue as described in Algorithms by Robert Sedgewick.

• Host: GitHub
• URL: https://github.com/bb4/bb4-a-star
• Owner: bb4
• License: mit
• Created: 2017-01-01T19:03:25.000Z (almost 8 years ago)
• Default Branch: master
• Last Pushed: 2023-01-29T17:55:25.000Z (almost 2 years ago)
• Last Synced: 2024-04-17T21:18:24.010Z (7 months ago)
• Topics: algorithm, optimization, scala
• Language: Scala
• Size: 277 KB
• Stars: 2
• Watchers: 2
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE.md

Awesome Lists containing this project

README

        
# A-star and IDA-star

Scala implementation of generic [A-Star](https://en.wikipedia.org/wiki/A*_search_algorithm) [IDA-star](https://en.wikipedia.org/wiki/Iterative_deepening_A*) search algorithms 

A-Star search uses a mutable heap priority queue. It is a fast search, but can be very space intensive if the search space is large.

IDA-Star is a version that uses depth first search iterative deepening in order to trade some speed for reduced memory. Some problem spaces, like Rubix cube for example, have such huge problem spaces that regular A-star can quickly exhaust memory.

## Build Instructions

* Install git, scala

* git clone https://github.com/barrybecker4/bb4-A-star.git

* In bash shell run `./gradlew`

* Or import gradle project into intellij and run from there (preferred)