Search Results for ""
21 - 30 of 3197 for chess mathSearch Results
View search results from all Wolfram sites (467155 matches)A giraffe graph is a graph formed by all possible moves of a hypothetical chess piece called a "giraffe" which moves analogously to a knight except that it is restricted to ...
A black bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board), when ...
A white bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board), when ...
A camel graph is a graph formed by all possible moves of a hypothetical chess piece called a "camel" which moves analogously to a knight except that it is restricted to moves ...
A bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board). To form the ...
Let sigma_0(n) and sigma_1(n) denote the number and sum of the divisors of n, respectively (i.e., the zeroth- and first-order divisor functions). A number n is called sublime ...
The diagonal slash "/" used as the bar between numerator and denominator of an in-line fraction (Bringhurst 1997, p. 284). The solidus is also called a diagonal. Special care ...
A differential equation is an equation that involves the derivatives of a function as well as the function itself. If partial derivatives are involved, the equation is called ...
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 ...
Conway games were introduced by J. H. Conway in 1976 to provide a formal structure for analyzing games satisfying certain requirements: 1. There are two players, Left and ...
...