package knights_tour
 sectionYPositions = computeSectionYPositions($el), 10)"
  x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
  >
  
  
On This Page
  
  
  Solves the Knight's tour puzzle; and others
Install
    
    dune-project
 Dependency
Authors
Maintainers
Sources
  
    
      knights_tour-0.0.2.tbz
    
    
        
    
  
  
  
    
  
  
    
  
        sha256=8362f846492183e83e1901f73933d772c193c08b8a375480c28d0f23f0d29e11
    
    
  sha512=5fe79ac95a3e5a2e01d429665fa7a8bfef422d9843758b35db2c8efc299c762c1d22974266f5e8802ee6f81e09223aa90476824d1fd93540c473cc8a357d38a3
    
    
  doc/README.html
Knights Tour
An ocaml puzzle solver that solves the classic Knight's Tour and Pentomino puzzles.
To run the solver:
dune exec ./knight_solve.exe # Solve knights_tourTo play the game yourself interactively:
dune exec ./knight_play.exePentominos
To run the solver:
dune exec ./pento_solve.exeOpam install
opam install knigths_tourApi docs
This puzzle solver was essentially a test-case for experimenting with a general purpose 'searchspace solver'. This is included as a library that might potentially be of use outside of this project.
The generated api docs are here. The most interesting part of this library is the SearchSpace Module. The rest of the code isn't really as useful or re-usable and has almost no documentation.
However the code that creates a 'searchspace' to solve the puzzle is here and may make for a good example on how it is intended to be used.
 sectionYPositions = computeSectionYPositions($el), 10)"
  x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
  >
  
  
  On This Page