9786132890627 - Knight's tour: Knight (chess), Chessboard, Chess, Computer science, Hamiltonian path problem, Graph theory, Time complexity, Leonhard Euler (3 resultados)

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 108 pp. Englisch.

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. The Knight's Touris a mathematical problem involving a knight on a chessboard. The knightis placed on the empty board and, moving according to the rules ofchess, must visit each square exactly once. A knight's tour is called aclosed tour if the knight ends on a square attacking the square fromwhich it began (so that it may tour the board again immediately with thesame path). Otherwise the tour is open. The exact number of open toursis still unknown. Creating a program to solve the knight's tour is acommon problem given to computer science students. Variations of theknight's tour problem involve chessboards of different sizes than theusual 8 × 8, as well as irregular (non- rectangular) boards.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 108 pp. Englisch.

Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering.