This page is intended to inform and solve the "Knight's tour " in spanish "El problema del caballo", and respecting the valid moves for this piece - to go through each of the boxes without passing through it twice, returning (or not) to the starting position.
Being the most optimal the Warnsdorf heuristic, because it successfully finds a solution in linear time.
๐จ Santiago Urbano Rivadeneira ๐ง E-mail
Github ๐ฆ Twitter ๐ Linkedin