solve関数
リファレンスの説明と例は英語です。見出しと目次は日本語です。
A bounded depth-first proof search. A limit is never reported as impossibility.
インポート
import { solve } from "@johnmorrisdotca/tobiishi";
定義
function solve(game: Game, maxNodes?: number): Solution
引数
| 名前 | 型 | 説明 |
|---|---|---|
game | Readonly<{ board: Board; start: readonly boolean[]; pegs: readonly boolean[]; target: number | null; history: readonly Jump[]; helped: boolean; }> | The immutable native peg position, board, target, history and assistance marker. |
maxNodes (省略可) | number | A positive safe-integer search budget; exhausting it yields limit, not impossible. |
戻り値
Solution
A bounded depth-first proof search. A limit is never reported as impossibility.
例
import { makeBoard, newGame, solve } from "@johnmorrisdotca/tobiishi";
const board = makeBoard("Three holes",[{x:0,y:0},{x:1,y:0},{x:2,y:0}]);
const game = newGame(board,[true,true,false],2);
console.log(solve(game,100));{
status: 'solved',
jumps: [ { from: 0, over: 1, to: 2 } ],
visited: 1
}出力(このページを作ったときに実行した結果)
この日本語は、まだ日本語を母語とする方の確認を受けていません。訂正を歓迎します。