Skip to content
This repository was archived by the owner on Dec 16, 2019. It is now read-only.

Algorithm Subsystem

Buster Darragh-Major edited this page Aug 16, 2018 · 6 revisions

The algorithm section of this application is split into three distinct parts.

  1. The base algorithm used to search the state space
  2. The pruning heuristics that evaluate whether or not the given state has already been explored
  3. The lower bound estimate used to determine whether there is a solution through this state better than our current one

Each are extensible and independent to make the system flexible and reusable.

Implementations

Algorithms

Pruning

Pruning

Clone this wiki locally