Search Results for ""

sum_(k=0)^dr_k^B(d-k)!x^k=sum_(k=0)^d(-1)^kr_k^(B^_)(d-k)!x^k(x+1)^(d-k).

The m×n knight graph is a graph on mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a knight (which may ...

The term "(a,b)-leaper" (sometimes explicitly called a "single-pattern leaper") describes a fairy chess piece such as a knight that may make moves which simultaneously change ...

The m×n king graph is a graph with mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a king. The number ...

A game is defined as a conflict involving gains and losses between two or more opponents who follow formal rules. The study of games belongs to a branch of mathematics known ...

A problem in game theory first discussed by A. Tucker. Suppose each of two prisoners A and B, who are not allowed to communicate with each other, is offered to be set free if ...

Roundoff error is the difference between an approximation of a number used in computation and its exact (correct) value. In certain types of computation, roundoff error can ...

The m×n queen graph Q_(m,n) is a graph with mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a queen. ...

The m×n rook graph (confusingly called the m×n grid by Brouwer et al. 1989, p. 440) and also sometimes known as a lattice graph (e.g., Brouwer) is the graph Cartesian product ...

The "15 puzzle" is a sliding square puzzle commonly (but incorrectly) attributed to Sam Loyd. However, research by Slocum and Sonneveld (2006) has revealed that Sam Loyd did ...