Search Results for ""

A position in a game is safe for a player A if the person who plays next (player B) will lose.

An initial point that provides safe convergence of Newton's method (Smale 1981; Petković et al. 1997, p. 1).

A position in a game is unsafe for player A if the person who plays next (player B) can win. Every unsafe position can be made safe by at least one move.

A theory of constructing initial conditions that provides safe convergence of a numerical root-finding algorithm for an equation f(z)=0. Point estimation theory treats ...

A game played with two heaps of counters in which a player may take any number from either heap or the same number from both. The player taking the last counter wins. The rth ...

Minesweeper is single-player logic-based computer game played on rectangular board whose object is to locate a predetermined number of randomly-placed "mines" in the shortest ...