solveHitori関数
リファレンスの説明と例は英語です。見出しと目次は日本語です。
Counts distinct minimal shade patterns: an answer shades only squares that settle a duplicate, so extra shades are never a second answer. A non-complete result never asserts uniqueness.
インポート
import { solveHitori } from "@johnmorrisdotca/kazu/hitori";
ほかのエクスポート元: @johnmorrisdotca/kazu
定義
function solveHitori(board: HitoriBoard, options?: { limit?: number; nodes?: number; }): HitoriSolve
引数
| 名前 | 型 | 説明 |
|---|---|---|
board | HitoriBoard | The valid native board with its printed clues and dimensions. |
options (省略可) | { limit?: number; nodes?: number; } | Solution/node limits or native SVG choices specified by the signature. |
戻り値
HitoriSolve
Counts distinct minimal shade patterns: an answer shades only squares that settle a duplicate, so extra shades are never a second answer. A non-complete result never asserts uniqueness.
例
import type { HitoriBoard } from "@johnmorrisdotca/kazu/hitori";
import { solveHitori } from "@johnmorrisdotca/kazu/hitori";
const hitoriBoard: HitoriBoard = {"size":5,"numbers":[4,5,5,1,2,5,2,3,2,1,2,5,4,2,2,3,1,2,5,4,2,3,1,3,4]};
console.log(solveHitori(hitoriBoard,{limit:2,nodes:20000}));{
count: 1,
solution: [
false, true, false, false,
false, false, false, false,
true, false, true, false,
false, false, true, false,
false, false, false, false,
false, true, false, false,
true
],
complete: true,
nodes: 0
}出力(このページを作ったときに実行した結果)
この日本語は、まだ日本語を母語とする方の確認を受けていません。訂正を歓迎します。