solveCrossSums関数
リファレンスの説明と例は英語です。見出しと目次は日本語です。
Bounded exact counter over across and down runs; an interrupted search never proves uniqueness.
インポート
import { solveCrossSums } from "@johnmorrisdotca/kazu/cross-sums";ほかのエクスポート元: @johnmorrisdotca/kazu
定義
function solveCrossSums(board: CrossSumsBoard, entries?: readonly number[], options?: { limit?: number; nodes?: number; }): CrossSumsSolve引数
| 名前 | 型 | 説明 |
|---|---|---|
board | CrossSumsBoard | The valid native board with its printed clues and dimensions. |
entries (省略可) | readonly number[] | Current row-major entries; omit to search from printed clues. |
options (省略可) | { limit?: number; nodes?: number; } | Solution/node limits or native SVG choices specified by the signature. |
戻り値
CrossSumsSolve
Bounded exact counter over across and down runs; an interrupted search never proves uniqueness.
例
import type { CrossSumsBoard } from "@johnmorrisdotca/kazu/cross-sums";
import { solveCrossSums } from "@johnmorrisdotca/kazu/cross-sums";
const crossSumsBoard: CrossSumsBoard = {"width":5,"height":5,"cells":[{"kind":"black","across":null,"down":null},{"kind":"black","across":null,"down":null},{"kind":"black","across":null,"down":10},{"kind":"black","across":null,"down":7},{"kind":"black","across":null,"down":12},{"kind":"black","across":null,"down":null},{"kind":"black","across":6,"down":null},{"kind":"white"},{"kind":"white"},{"kind":"white"},{"kind":"black","across":null,"down":null},{"kind":"black","across":23,"down":null},{"kind":"white"},{"kind":"white"},{"kind":"white"},{"kind":"black","across":null,"down":null},{"kind":"black","across":null,"down":null},{"kind":"black","across":null,"down":null},{"kind":"black","across":null,"down":null},{"kind":"black","across":null,"down":null},{"kind":"black","across":null,"down":null},{"kind":"black","across":null,"down":null},{"kind":"black","across":null,"down":null},{"kind":"black","across":null,"down":null},{"kind":"black","across":null,"down":null}]};
console.log(solveCrossSums(crossSumsBoard,undefined,{limit:2,nodes:20000}));{
count: 1,
solution: [
0, 0, 0, 0, 0, 0, 0, 2,
1, 3, 0, 0, 8, 6, 9, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0
],
complete: true,
nodes: 0
}出力（このページを作ったときに実行した結果）
この日本語は、まだ日本語を母語とする方の確認を受けていません。訂正を歓迎します。