package knights_tour
Solves the 'Knights Tour' and various 'Poyomino' puzzles
Install
Dune Dependency
Authors
Maintainers
Sources
knights_tour-0.0.5.tbz
sha256=470c6d1b00b68b3bb6ba38a422a4698350564d803e20e7a7627245a253a7c890
sha512=0548d3c90c25e1dd442b43857d62aac19c98f676fedc344071635bc3ce680543fad3998a8b79fa77d6df3726c85fcf7fe14d692e3c30e5485f91f953f020cd74
doc/knights_tour.searchspace/Searchspace/Treequence/index.html
Module Searchspace.Treequence
Source
A Treequence
is 'pure/functional' data structure that represents a finite, ordered sequence of elements. I.e it is much like a list. Unlike a typical list implementation it supports efficient pushing and popping on both the front and back. Thus it can be used interchangeably as a Stack or a Queue without much of a performance penalty.
A 'a t
is a Treequence containing elements of type 'a
.
map f t
applies a function to each element of t, creating a new Treequence with the results.
append s1 s2
Creates Treequence that contains all elements of s1
followed by all elements of s2
.
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>