instinctive instinctive

Adding Custom Haskell Dependencies in Nix

When using developPackage in a default.nix, you may need to depend on Haskell libraries that aren't in nixpkgs — either from a personal GitHub repo or from your local filesystem. Both cases follow the same pattern: override haskellPackages with a custom overrides function and use callCabal2nix to build the package from source.

From a Personal GitHub Repository

Use fetchFromGitHub to pull the source and callCabal2nix to build it:

let

documentclass	extarticle
fontsize	9pt

Indonesia

Agree whether the amount of money players possess will be open or closed information.
Each player takes a set of wooden markers and 100 rupiah. Place one marker on the first spot of each of the R&D tracks.
Take one marker from each player and place them on the Turn Order track in a random order.

BUS Rules

Setup

Put one of the 15 total passenger meeples on each of the four central intersections. Put 5 (4 if 3 players) time stones in The Clock area, with one of them on the home icon. Give the starting player marker to a randomly determined player.
Each player takes 1 score marker, 20 action markers, and an (unlimited) supply of bus tokens and bus line sticks. Put the score marker on zero, and one bus token in the Bus Depot.
In player order, each player picks two buildings from the supply and places them on any empty "A" location.
In player order, each player places one bus line stick on any street without limitation.
In reverse player order, each player adds one bus line stick using the normal rules for Line Extension.

Functional Programming in Scala: Chapter 2, Exercise 2

Problem Statement

Write isSorted, which checks whether an Array[A] is sorted according to a given comparison function cmp(A,A) => Boolean.

Solution

The comparison function must evaluate to true for successive elements of the array.

The Any Worker Problem

In The Manhattan Project (TMP) boardgame, you may use any three of your workers to run this mine.

There are effectively six kinds of workers in TMP, the cross-product of three occupations: Laborers, Engineers, and Scientists, and two types of employment: Full Time Employee (FTE) and Contractor.

Here's an example function to determine whether a set is strongly connected with respect to an adjacency function, implemented with direct recursion:

connected :: Ord a => (a -> [a]) -> Set a -> Bool
connected f s = 
    go (take 1 $ Set.elems s) s
  where
    go _ s | Set.null s = True
    go [] _             = False

Simple Chess Protocol

Existing chess server protocols (UCI) do a lot of things we don't need. Hence this simpler protocol.

Your chess program will read and write lines of input and output. Informally, the first input line will either be black or white, indicating which side your program will play.

	{-# LANGUAGE MultiParamTypeClasses #-}
	{-# LANGUAGE TypeFamilies #-}
	{-# LANGUAGE GeneralizedNewtypeDeriving #-}
	{-# LANGUAGE StandaloneDeriving #-}

	import qualified Data.Vector.Generic as G
	import qualified Data.Vector.Generic.Mutable as M
	import qualified Data.Vector.Unboxed as U
	import Data.Word (Word64)

	-- boilerplate elided from gist

	docase :: Int -> IO ()
	docase i = do
	printf "Case #%d: " i
	_ <- getLine
	ss <- words <$> getLine
	outimp putStrLn $ solve ss

	aside (x:_,_) = x

	black = '#4e4e4e';
	red = '#d68787'; // red
	green = '#5f865f'; // green
	yellow = '#d8af5f'; // yellow
	blue = '#85add4'; // blue
	magenta = '#d7afaf'; // pink
	cyan = '#87afaf'; // cyan
	white = '#d0d0d0'; // light gray
	lightBlack = '#626262'; // medium gray
	lightRe