DIR Return Create A Forum - Home
       ---------------------------------------------------------
       knight tours
  HTML https://knighttours.createaforum.com
       ---------------------------------------------------------
       *****************************************************
   DIR Return to: general Hamiltonian cycles problem
       *****************************************************
       #Post#: 17--------------------------------------------------
       Snakes and Ladders heuristics
       By: gsgs Date: June 23, 2023, 5:27 am
       ---------------------------------------------------------
       Snakes and Ladders heuristics (2012) :
       ... is not available.
  HTML https://mpc.zib.de/archive/2014/1/Baniasadi2014_Article_DeterministicSnakesAndLaddersH.pdf
       > SLH correctly solved all graph instances that we tried, which
       > contained up to 5,000 vertices.
       well, that was in 2012 ...
       they only compare it with TSP-solvers, which however are not
       specialised on HCP
  HTML https://arxiv.org/pdf/1806.09285
       TSP=Travelling Salesman Problem
  HTML https://en.wikipedia.org/wiki/Travelling_salesman_problem
       HCP=Hamiltonian Cycle Problem
  HTML https://en.wikipedia.org/wiki/Hamiltonian_path_problem
       *****************************************************