Haskell

We solve a variant of the N-Queens problem using Haskell, following a backtracking strategy. We explore different heuristics for generating and ranking candidates, and pruning the search space.

We often hear that we should strive for function purity for many reasons: referential transparency, testability, easier to reason about, etc. But what about when effects are necessary? This post presents a methodology for keeping effectful code clean.