# Haskell Quiz/Countdown

### From HaskellWiki

< Haskell Quiz(Difference between revisions)

(creation) |
(added Graham Huttons JFP paper to the solutions) |
||

Line 7: | Line 7: | ||

==Solutions== |
==Solutions== |
||

+ | * [http://www.cs.nott.ac.uk/~gmh/bib.html#countdown Graham Hutton] (JFP paper) |
||

* [[Haskell Quiz/Countdown/Solution Dolio|Dan Doel]] |
* [[Haskell Quiz/Countdown/Solution Dolio|Dan Doel]] |

## Revision as of 14:03, 30 November 2006

This question was based on a UK game show. Given a target number, a set of source numbers which may be used at most once, and the 4 basic arithmetic operators (+, -, *, /), construct the whole number closest to the target.

## 1 The Problem

## 2 Solutions

- Graham Hutton (JFP paper)
- Dan Doel