Celestial Contrakt
Documentation of initial project development for Schwartz Projetcs
1 November
works by
Christina Mitrentse
*Jonas Ranson
Lee Wagstaff
Marc Wayland
*The knight’s tour problem is an instance of the more general Hamiltonian path problem in graph theory. The problem of finding a closed knight’s tour is similarly an instance of the hamiltonian cycle problem. Note however that, unlike the general Hamiltonian path problem, the knight’s tour problem can be solved in linear time.
