sparseCandidate関数
リファレンスの説明と例は英語です。見出しと目次は日本語です。
One sparse candidate level, or null. From a filling proved to have one
answer, lines are joined one join at a time, in a random order, and a join is
kept only while the board still has exactly one answer — so what is left is
as few lines as this filling allows without a second answer creeping in. A
board that does not get down to sparseMost is dropped.
インポート
import { sparseCandidate } from "@johnmorrisdotca/tsunagi";定義
function sparseCandidate(size: number, random: Random, budget: number): LinkCandidate | null引数
| 名前 | 型 | 説明 |
|---|---|---|
size | number | The number of cells on each side of the board. |
random | Random | A reproducible random source returning values in [0,1). |
budget | number | The maximum search-work budget; exhaustion must be treated as inconclusive. |
戻り値
LinkCandidate | null
One sparse candidate level, or null. From a filling proved to have one answer, lines are joined one join at a time, in a random order, and a join is kept only while the board still has exactly one answer — so what is left is as few lines as this filling allows without a second answer creeping in. A board that does not get down to sparseMost is dropped.
例
import { seededRandom, sparseCandidate } from "@johnmorrisdotca/tsunagi";
console.log(sparseCandidate(4,seededRandom(42),20000));この日本語は、まだ日本語を母語とする方の確認を受けていません。訂正を歓迎します。