Reference · Rules, solvers and generation
waypointCandidatefunction
WAYPOINTS. A plain filling whose layout has more than one answer, given
waypoints — cells in the middle of the answer's lines, each kept for the line
through it — until it has one, and then each taken away again where it is not
needed: every waypoint left is one a player has to use. At most most.
Import it
import { waypointCandidate } from "@johnmorrisdotca/tsunagi";Definition
function waypointCandidate(size: number, random: Random, longest: number, budget: number, most: 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. |
most | number | The maximum repairs, waypoints or pairs specified by this signature. |
style (optional) | FillingStyle | Optional preferences for the seeded filling process. |
Returns
TwistCandidate | null
A proved board using waypoints, or null when the requested bounded attempt cannot produce one.
Examples
import { seededRandom, waypointCandidate } from "@johnmorrisdotca/tsunagi";
console.log(waypointCandidate(4,seededRandom(42),8,20000,2));