Copyright	(c) Eric Mertens 2017
License	ISC
Maintainer	emertens@gmail.com
Safe Haskell	None
Language	Haskell2010

Main

Description

Build long bridges out of pieces with a pin count on each end. Pieces can be flipped over and to be connected the pin counts of two pieces must match.

Synopsis

main :: IO ()
orient :: Int -> (Int, Int) -> [(Int, Int)]
search :: Int -> Int -> Int -> [(Int, Int)] -> [(Int, Int)]

Documentation

main :: IO () Source #

Print solutions to both parts of the task.

orient Source #

Arguments

:: Int	target left pin count
-> (Int, Int)	current piece
-> [(Int, Int)]	possible orientations of this piece

Given a required number of ports and a piece, return the possible unique orientations of that piece.

search Source #

Arguments

:: Int	current bridge length
-> Int	current bridge weight
-> Int	required port pins
-> [(Int, Int)]	available pieces
-> [(Int, Int)]	length and weight of possible bridges

Generate statistics for all of the possible bridges given some pieces.