|
|
|
King's Graph: Graph theory, Graph mathematics, King chess, Chess, Chessboard, On-Line Encyclopedia of Integer Sequences, Moore neighborhood, Knight's
|
(Buch) |
Dieser Artikel gilt, aufgrund seiner Grösse, beim Versand als 2 Artikel!
| Lieferstatus: |
 i.d.R. innert 7-14 Tagen versandfertig |
| Veröffentlichung: |
März 2026
|
| Genre: |
Schulbücher |
| ISBN: |
9786132703750 |
|
EAN-Code:
|
9786132703750 |
| Verlag: |
Omniscriptum |
| Einband: |
Kartoniert |
| Sprache: |
English
|
| Dimensionen: |
H 220 mm / B 150 mm / D 6 mm |
| Gewicht: |
143 gr |
| Seiten: |
84 |
| Bewertung: |
Titel bewerten / Meinung schreiben
|
| Inhalt: |
| Please note that the content of this book primarily consists of articles
available from Wikipedia or other free sources online. In graph theory,
a king's graph is a graph that represents all legal moves of the king
chess piece on a chessboard where each vertex represents a square on a
chessboard and each edge is a legal move. More specifically, an n times
m king's graph is a king's graph of an n times m chessboard. For a n
times m king's graph the total number of vertices is simply nm. For a n
times n king's graph the total number of vertices is simply n2 and the
total number of edges is (2n ¿ 2)(2n ¿ 1). Additionally, the number of
edges for various n is identified as A002943 in the On-Line Encyclopedia
of Integer Sequences. |
|
Newsfeed | 
Facebook | 
Twitter
