Pages that link to "Item:Q678854"

The following pages link to An efficient algorithm for the Knight's tour problem (Q678854):

Displaying 8 items.

• Generalized knight's tour on 3D chessboards (Q602746) (← links)
• An efficient algorithm for the Knight's tour problem (Q678854) (← links)
• The traveling salesman problem on grids with forbidden neighborhoods (Q1680496) (← links)
• Optimal algorithms for constructing knight's tours on arbitrary \(n\times m\) chessboards (Q1763476) (← links)
• Taming the knight's tour: minimizing turns and crossings (Q2067620) (← links)
• Hamiltonian cycle curves in the space of discounted occupational measures (Q2095221) (← links)
• Algorithms for finding knight's tours on Aztec diamonds (Q2357657) (← links)
• Geometric interpretation of Hamiltonian cycles problem via singularly perturbed Markov decision processes (Q4467171) (← links)