package knights_tour

You can search for identifiers within the package.

in-package search v0.2.0

Solves the Knight's tour puzzle; and others

Install

dune-project

Dependency

github.com Readme Edit opam file Versions (5)

Authors

K

Kris De Volder

Maintainers

K

kris.de.volder@gmail.com

Sources

knights_tour-0.0.2.tbz

sha256=8362f846492183e83e1901f73933d772c193c08b8a375480c28d0f23f0d29e11

sha512=5fe79ac95a3e5a2e01d429665fa7a8bfef422d9843758b35db2c8efc299c762c1d22974266f5e8802ee6f81e09223aa90476824d1fd93540c473cc8a357d38a3

doc/knights_tour.pentominos/Pentominos/Puzzle/index.html

Module `Pentominos.Puzzle`Source

A polyomino puzzle consists of a board and a set of polyomino pieces to be placed onto the board. The puzzle is considered solved when all pieces have been placed.

Sourcetype t = {

pieces : Polyomino.t list;
(*
pieces remaining to be placed
*)
board : Board.t;
(*
board upon which to place the pieces. For a (partially) solved puzzle it tracks what piece occupies each square.
*)

}

Data type representing the state of a puzzle.

Sourceval classic : t

The initial state of the 'classic' Pentominos puzzle.

Sourceval classic_no_symmetric_solutions : t

Same as the 'classic' puzzle, but one assymetric puzzle piece deliberately has all but one of its variants removed (this ensures that symmetric solutions are eliminated, by not allowing that one piece to only be used in one orientation)

Source

val solve : 
  ?report_progress:(string -> t -> unit) ->
  t ->
  Board.t Knights_tour.Searchspace.t