minebender-game

Releases (1)

• 1.0.0.0 indexed

Definitions (1,011)

proof_solver.bend

• def tput_keeps
• def tput_self
• def or_l
• def or_r
• def or_cases
• def order_split.self
• def order_split.rest
• def order_split.cell
• law order_splitA to-do cell is in the near part or the far part.
• law tcontains_append
• law order_member
• def hc_member.go
• law hc_memberA hidden cell of ps is one of the hidden cells.
• def hc_sound.f
• def hc_sound.t
• def hc_sound.go
• law hc_soundA hidden cell is hidden and one of the cells it was taken from.
• def start_cover.seen
• def start_cover.cell
• law start_cover.go
• def all_valid
• def WitnessA layout that passes the check and mines c.
• def covered_extract.go
• law covered_extract
• def loop_found_some
• def LoopSome
• def loop_some.lift
• def loop_some.found
• def loop_some.cov
• law loop_someWhen the loop names c, c is one of its cells and its search found nothing.
• def loop_found_none
• def witness_move
• def loop_none.pick
• def loop_none.found
• def loop_none.pick2
• def loop_none.cov
• law loop_noneWhen the loop names no cell, every one of its cells has a checked layout that mines it.
• law s_hidden_eq
• law hid_toHidden in LAWS.bend's sense: on the board, and hidden in the rows.
• law hid_on
• law hid_hp
• def hc_on.cell
• law hc_on
• law head_some
• law head_none
• def solver_tok
• def solver_ton
• def tok_f
• def ton_f
• law tok_tall
• law ton_tall
• law tcontains_pre
• def or_mono
• law covers_preCells still to do stay to do with more todos in front.
• def plan_qsThe heuristic order of the search for c, as the plan builds it.
• def plan_k
• def plan_list
• law plan_shape
• law search_noneA failed search for c rules out every consistent layout mining c.
• def safe_fn
• def PF_both
• def safe_none
• def safe_hidden
• def safe_hidden.k
• def solve_safe.k
• def solve_safe.go
• law solve_safeWitness soundness: a cell the solver names is provably safe.
• def stuck_wit
• def solve_stuck.go
• def solve_stuck.k
• law solve_stuckStuck soundness: when the solver names no cell, no cell is provably safe.

proof_speed.bend

• law row_none_set
• law row_true_set_t
• law row_true_set_f
• law none_go
• law true_go_t
• law true_go_f
• def cell_noneThe row of an unassigned cell, and the cell in it.
• def row_get
• law none_setAssigning an unassigned cell of the board uses up one unassigned cell...
• law true_set_t...
• law true_set_f...
• def tallEvery todo of ts passes f (with e for f's context).
• def tall_head
• def tall_tail
• def tall_cons
• def tall_put
• law tall_append
• law tall_nears
• law tall_fars
• law tall_with_c
• law tall_gather
• law tall_drop
• law tall_take
• law tall_planThe order of every search passes whatever the cells of a solve pass.
• def con_f
• law con_todosThe todos of cells on the board are on the board.
• def none_of
• def one_less
• def when_or_eq