Zobrazeno 1 - 10
of 14
pro vyhledávání: '"legal knight's move"'
Publikováno v:
Symmetry, Vol 12, Iss 8, p 1217 (2020)
A (legal) knight’s move is the result of moving the knight two squares horizontally or vertically on the board and then turning and moving one square in the perpendicular direction. A closed knight’s tour is a knight’s move that visits every sq
Externí odkaz:
https://doaj.org/article/afbc22847b964d75b5d4e290d8574332
Publikováno v:
Symmetry, Vol 12, Iss 1217, p 1217 (2020)
Symmetry
Volume 12
Issue 8
Symmetry
Volume 12
Issue 8
A (legal) knight&rsquo
s move is the result of moving the knight two squares horizontally or vertically on the board and then turning and moving one square in the perpendicular direction. A closed knight&rsquo
s tour is a knight&rsquo
s move is the result of moving the knight two squares horizontally or vertically on the board and then turning and moving one square in the perpendicular direction. A closed knight&rsquo
s tour is a knight&rsquo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::26895b65a4c1f9a19e0aa27c7152a7a4
https://www.mdpi.com/2073-8994/12/8/1217
https://www.mdpi.com/2073-8994/12/8/1217
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Symmetry (20738994); Aug2020, Vol. 12 Issue 8, p1217-1217, 1p
Publikováno v:
Asian-European Journal of Mathematics; Jun2021, Vol. 14 Issue 6, pN.PAG-N.PAG, 17p
This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, t
LEARN HOW TO USE DATA STRUCTURES IN WRITING HIGH PERFORMANCE PYTHON PROGRAMS AND ALGORITHMS This practical introduction to data structures and algorithms can help every programmer who wants to write more efficient software. Building on Robert Lafore'
Autor:
Michel Rigo
Advanced Graph Theory focuses on some of the main notions arising in graph theory with an emphasis from the very start of the book on the possible applications of the theory and the fruitful links existing with linear algebra. The second part of the