Search Results for ""
31 - 40 of 71 for Galton BoardSearch Results
View search results from all Wolfram sites (692 matches)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 ...
Find the maximum number of bishops B(n) that can be placed on an n×n chessboard such that no two attack each other. The answer is 2n-2 (Dudeney 1970, Madachy 1979), giving ...
An antelope graph (Jelliss 2019) is a graph formed by all possible moves of a hypothetical chess piece called an "antelope" which moves analogously to a knight except that it ...
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 ...
Mastermind is a simple two-player code-breaking board game invented in 1970 by Mordecai Meirowitz, an Israeli postmaster and telecommunications expert. It may have been ...
A fiveleaper graph is a graph formed by all possible moves of a hypothetical chess piece called a "fiveleaper" which moves analogously to a knight except that it is ...
A board covered by a lattice of pegs around which one can span rubber bands to form segments and polygons. It was invented by the Egyptian mathematician and pedagogist Caleb ...
What is the maximum number of queens that can be placed on an n×n chessboard such that no two attack one another? The answer is n-1 queens for n=2 or n=3 and n queens ...
The cochleoid, whose name means "snail-form" in Latin, was first considered by John Perks as referenced in Wallis et al. (1699). The cochleoid has also been called the oui-ja ...
The number of cells in a generalized Chinese checkers board (or "centered" hexagram). Unlike the polygonal numbers, there is ambiguity in the case of the star numbers as to ...
...