minebender-game

Releases (1)

• 1.0.0.0 indexed

Definitions (1,011)

board.bend

• def at
• def mine
• def on_board
• def same
• def dist
• def within_one
• def adjacent
• def row_cells
• def cells.go
• def cells
• def touching
• def neighbours
• def count_mines
• def adj_mines
• def row_mines
• def total_mines
• def zero
• def rows_wide
• def shaped
• def set_atThe grid g with the cell at p replaced by v (unchanged when p is off it).
• def blankA w-by-h grid of v.
• def row_false
• def count_falseHow many cells of the grid are False.
• def contains
• def remove

game.bend

• type GameThe real mines, the cells revealed so far, the player's flags (any cells; only hidden ones count as flagged) and the status.
• def status
• def is_playing
• def unrevealedp is a cell of the board that is not revealed yet.
• def flagged
• def seen_pickWhat the player sees at p.
• def seen_at
• def know_row
• def know_rows
• def knowledge
• def all_safe.goEvery safe cell is revealed.
• def all_safe
• def won_or_playing
• def fresh
• def clamp
• def custom
• def setup
• type ZoneThe cells kept free of mines: `first`, and its neighbours when `wide`.
• def gen.out
• type GenState
• def gen.coin
• def gen.pickWhether the next candidate gets a mine: forced when every candidate left needs one, else a coin flip that comes up heads about need/left of the time.
• def gen.bitWhether cell p gets a mine.
• def gen.next.go
• def gen.nextThe state after cell p.
• def gen.row
• def gen.row_stateThe state after a row.
• def gen.rows
• def gen.leftHow many cells of ps are outside the zone.
• def place_minesRoom for the first click's neighbours: at least 9 cells left free.
• type WorkA cell queued by the flood, with the path that reached it from the cell first opened, newest step first (kept only so the proofs can name it).
• def head_hiddenThe first cell of `work` is on the board and not revealed yet.
• def worksThe cells ns, each reached one step past `back`.
• def push
• def floodReveal the cells of `work`, and the neighbours of every zero revealed.
• def explode
• def flood_open
• def open.go
• def can_openDuring play, a hidden cell of the board can be opened.
• def layout_of
• def openReveal p whether or not it is flagged (Reveal, Chord and Assist use it).
• def reveal.go
• def reveal
• def flags_among
• def is_hidden
• def hidden
• def seen
• def hidden_unflagged
• def chord_targets.pick
• def chord_targets.go
• def chord_targets
• def chord_play
• def toggle.go
• def toggle
• def flag.go
• def can_flag
• def flag
• def safe_hereThe first cell of ps is safe and not revealed yet.
• def first_safe.go
• def first_safeThe first safe cell of ps that is not revealed yet.
• def any_shown
• def edgesThe cells of ps not revealed yet but next to a revealed one.
• def turnps from a point picked by k, wrapping around.
• def safe_listWhere the assist looks for a safe cell, k being a random number: first the hidden cells next to a revealed one, then every cell, each from a random point; last every cell in order, which never comes into play but lets the proofs see a safe cell is always found.
• def safe_cell
• def lose
• def assist.safe
• def assist.pick
• def assist.go
• def assist
• def step
• def mark.why
• def markA cell the end of the game singles out.
• def tile_lost
• def tile_hidden