hexCandidate関数
リファレンスの説明と例は英語です。見出しと目次は日本語です。
A HEXAGON: the board as Hexversi's honeycomb, the square's corners off the
board, filled with lines that may step along either slant as well as the four
ways a square allows (hexNeighboursOf). Only an odd side has a hexagon.
インポート
import { hexCandidate } from "@johnmorrisdotca/tsunagi";定義
function hexCandidate(size: number, random: Random, longest: number, budget: number, style?: FillingStyle): TwistCandidate | null引数
| 名前 | 型 | 説明 |
|---|---|---|
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. |
style (省略可) | FillingStyle | Optional preferences for the seeded filling process. |
戻り値
TwistCandidate | null
A proved hexagonal board, or null when generation or uniqueness proof fails.
例
import { hexCandidate, seededRandom } from "@johnmorrisdotca/tsunagi";
console.log(hexCandidate(5,seededRandom(42),10,20000));この日本語は、まだ日本語を母語とする方の確認を受けていません。訂正を歓迎します。