solveAkarifunction
Bounded constraint search over the rules in akariLogic.ts; a stopped proof is always marked incomplete.
Import it
import { solveAkari } from "@johnmorrisdotca/kazu/akari";Also exported from: @johnmorrisdotca/kazu
Definition
function solveAkari(board: AkariBoard, options?: { limit?: number; nodes?: number; }): AkariSolveParameters
| Name | Type | Description |
|---|---|---|
board | AkariBoard | The valid native board with its printed clues and dimensions. |
options (optional) | { limit?: number; nodes?: number; } | Solution/node limits or native SVG choices specified by the signature. |
Returns
AkariSolve
Bounded constraint search over the rules in akariLogic.ts; a stopped proof is always marked incomplete.
Examples
import type { AkariBoard } from "@johnmorrisdotca/kazu/akari";
import { solveAkari } from "@johnmorrisdotca/kazu/akari";
const akariBoard: AkariBoard = {"width":5,"height":5,"cells":[1,null,null,null,null,0,null,null,null,0,1,0,null,null,null,null,false,null,null,null,null,false,null,null,2]};
console.log(solveAkari(akariBoard,{limit:2,nodes:20000}));{ count: 1, solution: [ 1, 7, 15, 19, 23 ], complete: true, nodes: 0 }What it prints (run when this page was built)