DIR Return Create A Forum - Home
       ---------------------------------------------------------
       knight tours
  HTML https://knighttours.createaforum.com
       ---------------------------------------------------------
       *****************************************************
   DIR Return to: general Hamiltonian cycles problem
       *****************************************************
       #Post#: 15--------------------------------------------------
       Pettersson's 2014 program
       By: gsgs Date: June 22, 2023, 5:27 am
       ---------------------------------------------------------
       ... is not available.
       A description is in this paper :
  HTML https://www.combinatorics.org/ojs/index.php/eljc/article/download/v21i4p7/pdf
       my implementation :
  HTML http://magictour.free.fr/ptourg.c
       (max.12 paths, counting tours)
  HTML http://magictour.free.fr/hcp1.c
       
       (max 99 paths, counting only different pathstructures ==>
       yes/no)
       it solves (and counts all HCs in) 402 of the 1001 FHCP-challenge
       graphs
       in 25 hours. Another 45 were solved in 5 days
       (1.9GHz Laptop from 2012)
       *****************************************************