ReduceOptions型
リファレンスの説明と例は英語です。見出しと目次は日本語です。
Budgets and geometry choices for generating a puzzle by reducing clues.
インポート
import type { ReduceOptions } from "@johnmorrisdotca/tsunagi";定義
type ReduceOptions = {
budget?: number;
fewest?: number;
most?: number;
piece?: number;
longest?: number;
wrap?: boolean;
portals?: number;
waypoints?: number;
blocked?: ReadonlySet<number>;
blockedCount?: number;
greed?: number;
measure?: number;
};メンバー
| 名前 | 型 | 説明 |
|---|---|---|
budget (省略可) | number | undefined | Dead ends the solver may meet proving one join leaves the board with one answer. Default 20,000. |
fewest (省略可) | number | undefined | Stop joining when this many lines are left. Default one: join while a proof is cheap enough. |
most (省略可) | number | undefined | The most lines the board may end with, else none is made. Default |
piece (省略可) | number | undefined | How long a piece of line the cutting starts from is, in cells. Default 4. |
longest (省略可) | number | undefined | How far a line may grow before it is cut, in cells: the longest a line of the board can be. Default three times the side. |
wrap (省略可) | boolean | undefined | A board whose edges join. |
portals (省略可) | number | undefined | How many portals to put in. |
waypoints (省略可) | number | undefined | How many waypoints to put in. |
blocked (省略可) | ReadonlySet<number> | undefined | Cells no line enters. |
blockedCount (省略可) | number | undefined | How many blocked cells to scatter, none beside another, when |
greed (省略可) | number | undefined | How eagerly the lines the board is cut from take their tightest way on ( |
measure (省略可) | number | undefined | Dead ends the measuring solve may meet before the board is dropped. Default 200,000. |
例
import type { ReduceOptions } from "@johnmorrisdotca/tsunagi";
const value: ReduceOptions = {budget:20000,longest:8,most:8};
console.log(value);{ budget: 20000, longest: 8, most: 8 }出力（このページを作ったときに実行した結果）
この日本語は、まだ日本語を母語とする方の確認を受けていません。訂正を歓迎します。