Reference · Rules, solvers and generation
hexCandidatefunction
A HEXAGON: the board as Hexversi's honeycomb, the square's corners off the
board, filled with lines that may step along either slant as well as the four
ways a square allows (hexNeighboursOf). Only an odd side has a hexagon.
Import it
import { hexCandidate } from "@johnmorrisdotca/tsunagi";Definition
function hexCandidate(size: number, random: Random, longest: number, budget: number, style?: FillingStyle): TwistCandidate | nullParameters
| Name | Type | Description |
|---|---|---|
size | number | The number of cells on each side of the board. |
random | Random | A reproducible random source returning values in [0,1). |
longest | number | The maximum desired path length in cells. |
budget | number | The maximum search-work budget; exhaustion must be treated as inconclusive. |
style (optional) | FillingStyle | Optional preferences for the seeded filling process. |
Returns
TwistCandidate | null
A proved hexagonal board, or null when generation or uniqueness proof fails.
Examples
import { hexCandidate, seededRandom } from "@johnmorrisdotca/tsunagi";
console.log(hexCandidate(5,seededRandom(42),10,20000));