FP 13 - The Countdown Problem

This lecture shows how the concepts introduced so far can be used to develop an efficient program to solve a simple numbers game. We start by defining some types and utility functions, then formalise the rules of the game in Haskell, and finally present a simple brute force solution, whose performance is then improved in two steps.

Course playlist: tinyurl.com/haskell-notts