The following terms describe the properties used to distinguish between different styles of labyrinths created by the Daedalus algorithm (see the discussion in Daedalus in the 21st Century for more examples):

numCrossings

Number of times the path crosses the main axis (most historical labyrinths have numCrossings = 0 while the Bayeux labyrinth has numCrossings = 1).

numBayonets

Number of bayonets (where the path changes quadrants and depths at the same time).

maxInset

The maximum number of path widths out from the main axis that are allowed.

numCourses

The number of round courses as described by Hebert. A round course is an 8-unit part of the path with 3 folds that alternates long-short-long-short-long.

maxStraight

The maximum number of units in a row without changing direction. For most medieval labyrinths, this is two.

minStraight

The minimum number of units in a row without changing directions. For most labyrinths this is 1 but for Cretan style labyrinths it is 4.

Reversibility

The path from the inside out is identical to the path from the outside in.