DDA Repeating Loop Check

Add a check for a repeating loop that can occur when the same term is found to be a solution for the current node and child node.

Tree based DDA

A complete rewrite of the Deep Drilling Algorithm that uses the tree structure as described in the EAT 2 paper.

Improved SIGINT and SIGTERM signal handling

Provide much more graceful signal handling for cancelling beam algorithm search.

Use logger instead of print

Use logger instead of print, in order to allow web client to capture output.

Remove matplotlib install requirement

Remove matplotlib install requirement as it is not used.

Fix error in calculating i_H in AC check

Fixes an error in calculating i_H in the AC check. We now use the recursive formula i_H = 3 / (math.pow(1 - i_H, 2) + 3)

Patch for AC table

Patch to include the user inputted probabilities at height H=1 of the AC check table.

Add check to see if a groupoid is asymptotic complete

Adds the following options for checking if a groupoid is asymptotic complete:

Options for asymptotic complete:
  -ac, --asymptotic-complete
                        Check if groupoid is asymptotic complete.
  -acp AC_PROBABILITIES [AC_PROBABILITIES ...], --ac-probabilities AC_PROBABILITIES [AC_PROBABILITIES ...]
                        Probability values to use at height 1.
  -th TABLE_HEIGHT, --table-height TABLE_HEIGHT
                        Print a table of this height.

Update SBA to no longer use Fitness

Updates the SBA algorithm to no longer discard terms of lower fitness. As per the algorithm definition from EAT 3, the SBA should accept any valid female term regardless of fitness and advance to the next level of the beam.

Patch for bug running MFBA

The is a patch to fix an issue when running the MFBA algorithm. The application was expecting 2 values to be returned by the beam algorithm, the term and search time respectively, but the recursive call to the beam algorithm was assigning only a single value. This bug would result in the MFBA not running.