# 99 questions/90 to 94

### From HaskellWiki

RossPaterson (Talk | contribs) (another variant for P96) |
(moved solutions to subpages of 99 questions/Solutions. Still need solution for P94) |
||

(39 intermediate revisions by 5 users not shown) | |||

Line 1: | Line 1: | ||

__NOTOC__ |
__NOTOC__ |
||

− | These are Haskell translations of [http://www.ic.unicamp.br/~meidanis/courses/mc336/2006s2/funcional/L-99_Ninety-Nine_Lisp_Problems.html Ninety Nine Lisp Problems], |
+ | This is part of [[H-99:_Ninety-Nine_Haskell_Problems|Ninety-Nine Haskell Problems]], based on [https://prof.ti.bfh.ch/hew1/informatik3/prolog/p-99/ Ninety-Nine Prolog Problems]. |

− | which are themselves translations of [http://www.hta-bi.bfh.ch/~hew/informatik3/prolog/p-99/ Ninety-Nine Prolog Problems]. |
||

− | If you want to work on one of these, put your name in the block so we know someone's working on it. Then, change n in your block to the appropriate problem number, and fill in the <Problem description>,<example in lisp>,<example in Haskell>,<solution in haskell> and <description of implementation> fields. |
+ | If you want to work on one of these, put your name in the block so we know someone's working on it. Then, change n in your block to the appropriate problem number, and fill in the <Problem description>,<example in Haskell>,<solution in haskell> and <description of implementation> fields. |

== Miscellaneous problems == |
== Miscellaneous problems == |
||

Line 16: | Line 16: | ||

Example in Haskell: |
Example in Haskell: |
||

− | <pre> |
||

− | > length queens |
||

− | 92 |
||

− | > take 1 queens |
||

− | [[4,2,7,3,6,8,5,1]] |
||

− | </pre> |
||

− | Solution: |
||

<haskell> |
<haskell> |
||

− | queens = queens' 8 |
+ | > length (queens 8) |

+ | 92 |
||

+ | > head (queens 8) |
||

+ | [1,5,8,6,3,7,2,4] |
||

+ | </haskell> |
||

− | queens' 0 = [[]] |
+ | [[99 questions/Solutions/90 | Solutions]] |

− | queens' (n+1) = [ try:alreadySet | alreadySet <- queens' n, try <- [1..8], isSafe try alreadySet] |
||

− | where isSafe try alreadySet = not (sameRow try alreadySet || sameDiagonal try alreadySet) |
||

− | sameRow try alreadySet = try `elem` alreadySet |
||

− | sameDiagonal try alreadySet = any (\(col,q) -> abs(try - q) == col) $ zip [1..] alreadySet |
||

− | </haskell> |
||

− | By definition/data representation no two queens can occupy the same column. "try `elem` alreadySet" checks for a queen in the same row, "abs(try - q) == col" checks for a queen in the same diagonal. |
||

− | This is a modification of a function I wrote when I was just learning haskell, so there's certainly much to improve here! For one thing there is speedup potential in caching "blocked" rows, columns and diagonals. |
||

− | |||

== Problem 91 == |
== Problem 91 == |
||

(**) Knight's tour |
(**) Knight's tour |
||

− | Another famous problem is this one: How can a knight jump on an NxN chessboard in such a way that it visits every square exactly once? |
+ | Another famous problem is this one: How can a knight jump on an NxN chessboard in such a way that it visits every square exactly once? A set of solutions is given on the [[The_Knights_Tour]] page. |

Hints: Represent the squares by pairs of their coordinates of the form X/Y, where both X and Y are integers between 1 and N. (Note that '/' is just a convenient functor, not division!) Define the relation jump(N,X/Y,U/V) to express the fact that a knight can jump from X/Y to U/V on a NxN chessboard. And finally, represent the solution of our problem as a list of N*N knight positions (the knight's tour). |
Hints: Represent the squares by pairs of their coordinates of the form X/Y, where both X and Y are integers between 1 and N. (Note that '/' is just a convenient functor, not division!) Define the relation jump(N,X/Y,U/V) to express the fact that a knight can jump from X/Y to U/V on a NxN chessboard. And finally, represent the solution of our problem as a list of N*N knight positions (the knight's tour). |
||

Line 46: | Line 36: | ||

Example in Haskell: |
Example in Haskell: |
||

− | <pre> |
+ | |

+ | <haskell> |
||

Knights> head $ knightsTo 8 (1,1) |
Knights> head $ knightsTo 8 (1,1) |
||

[(2,7),(3,5),(5,6),(4,8),(3,6),(4,4),(6,5),(4,6), |
[(2,7),(3,5),(5,6),(4,8),(3,6),(4,4),(6,5),(4,6), |
||

Line 65: | Line 55: | ||

(6,2),(8,1),(7,3),(5,2),(7,1),(8,3),(7,5),(8,7), |
(6,2),(8,1),(7,3),(5,2),(7,1),(8,3),(7,5),(8,7), |
||

(6,8),(4,7),(2,8),(1,6),(2,4),(1,2),(3,1),(2,3)] |
(6,8),(4,7),(2,8),(1,6),(2,4),(1,2),(3,1),(2,3)] |
||

− | </pre> |
+ | </haskell> |

− | Solution: |
+ | [[99 questions/Solutions/91 | Solutions]] |

− | <haskell> |
||

− | module Knights where |
||

− | import Data.List |
||

− | type Square = (Int, Int) |
+ | == Problem 92 == |

− | -- Possible knight moves from a given square on an nxn board |
+ | (***) Von Koch's conjecture |

− | knightMoves :: Int -> Square -> [Square] |
||

− | knightMoves n (x, y) = filter (onBoard n) |
||

− | [(x+2, y+1), (x+2, y-1), (x+1, y+2), (x+1, y-2), |
||

− | (x-1, y+2), (x-1, y-2), (x-2, y+1), (x-2, y-1)] |
||

− | -- Is the square within an nxn board? |
+ | Several years ago I met a mathematician who was intrigued by a problem for which he didn't know a solution. His name was Von Koch, and I don't know whether the problem has been solved since. |

− | onBoard :: Int -> Square -> Bool |
||

− | onBoard n (x, y) = 1 <= x && x <= n && 1 <= y && y <= n |
||

− | -- Knight's tours on an nxn board ending at the given square |
+ | https://prof.ti.bfh.ch/hew1/informatik3/prolog/p-99/p92a.gif |

− | knightsTo :: Int -> Square -> [[Square]] |
||

− | knightsTo n finish = [pos:path | (pos, path) <- tour (n*n)] |
||

− | where tour 1 = [(finish, [])] |
||

− | tour k = [(pos', pos:path) | |
||

− | (pos, path) <- tour (k-1), |
||

− | pos' <- sortImage (entrances path) |
||

− | (filter (`notElem` path) (knightMoves n pos))] |
||

− | entrances path pos = |
||

− | length (filter (`notElem` path) (knightMoves n pos)) |
||

− | -- Closed knight's tours on an nxn board |
+ | Anyway the puzzle goes like this: Given a tree with N nodes (and hence N-1 edges). Find a way to enumerate the nodes from 1 to N and, accordingly, the edges from 1 to N-1 in such a way, that for each edge K the difference of its node numbers equals to K. The conjecture is that this is always possible. |

− | closedKnights :: Int -> [[Square]] |
||

− | closedKnights n = [pos:path | (pos, path) <- tour (n*n), pos == start] |
||

− | where tour 1 = [(finish, [])] |
||

− | tour k = [(pos', pos:path) | |
||

− | (pos, path) <- tour (k-1), |
||

− | pos' <- sortImage (entrances path) |
||

− | (filter (`notElem` path) (knightMoves n pos))] |
||

− | entrances path pos |
||

− | | pos == start = 100 -- don't visit start until there are no others |
||

− | | otherwise = length (filter (`notElem` path) (knightMoves n pos)) |
||

− | start = (1,1) |
||

− | finish = (2,3) |
||

− | -- Sort by comparing the image of list elements under a function f. |
+ | For small trees the problem is easy to solve by hand. However, for larger trees, and 14 is already very large, it is extremely difficult to find a solution. And remember, we don't know for sure whether there is always a solution! |

− | -- These images are saved to avoid recomputation. |
||

− | sortImage :: Ord b => (a -> b) -> [a] -> [a] |
||

− | sortImage f xs = map snd (sortBy cmpFst [(f x, x) | x <- xs]) |
||

− | where cmpFst x y = compare (fst x) (fst y) |
||

− | </haskell> |
||

− | This has a similar structure to the 8 Queens problem, except that we apply a heuristic invented by Warnsdorff: when considering next possible moves, we prefer squares with fewer open entrances. |
||

− | This speeds things up enormously, and finds the first solution to boards smaller than 76x76 without backtracking. |
||

− | == Problem 92 == |
+ | Write a predicate that calculates a numbering scheme for a given tree. What is the solution for the larger tree pictured below? |

− | <Problem description> |
+ | https://prof.ti.bfh.ch/hew1/informatik3/prolog/p-99/p92b.gif |

− | |||

− | Example: |
||

− | <pre> |
||

− | <example in lisp> |
||

− | </pre> |
||

Example in Haskell: |
Example in Haskell: |
||

− | <pre> |
||

− | <example in Haskell> |
||

− | </pre> |
||

− | Solution: |
||

<haskell> |
<haskell> |
||

− | <solution in haskell> |
+ | > head $ vonKoch [(1,6),(2,6),(3,6),(4,6),(5,6),(5,7),(5,8),(8,9),(5,10),(10,11),(11,12),(11,13),(13,14)] |

+ | [6,7,8,9,3,4,10,11,5,12,2,13,14,1] |
||

</haskell> |
</haskell> |
||

− | <description of implementation> |
+ | [[99 questions/Solutions/92 | Solutions]] |

+ | |||

== Problem 93 == |
== Problem 93 == |
||

Line 104: | Line 89: | ||

Given a list of integer numbers, find a correct way of inserting arithmetic signs (operators) such that the result is a correct equation. Example: With the list of numbers [2,3,5,7,11] we can form the equations 2-3+5+7 = 11 or 2 = (3*5+7)/11 (and ten others!). |
Given a list of integer numbers, find a correct way of inserting arithmetic signs (operators) such that the result is a correct equation. Example: With the list of numbers [2,3,5,7,11] we can form the equations 2-3+5+7 = 11 or 2 = (3*5+7)/11 (and ten others!). |
||

+ | |||

+ | Division should be interpreted as operating on rationals, and division by zero should be avoided. |
||

Example in Haskell: |
Example in Haskell: |
||

− | <pre> |
+ | |

− | P93> putStr $ unlines $ puzzle [2,3,5,7,11] |
+ | <haskell> |

+ | P93> mapM_ putStrLn $ puzzle [2,3,5,7,11] |
||

2 = 3-(5+7-11) |
2 = 3-(5+7-11) |
||

2 = 3-5-(7-11) |
2 = 3-5-(7-11) |
||

Line 118: | Line 105: | ||

2-(3-5)+7 = 11 |
2-(3-5)+7 = 11 |
||

2-3+5+7 = 11 |
2-3+5+7 = 11 |
||

− | </pre> |
+ | </haskell> |

+ | |||

The other two solutions alluded to in the problem description are dropped by the Haskell solution as trivial variants: |
The other two solutions alluded to in the problem description are dropped by the Haskell solution as trivial variants: |
||

+ | |||

<pre> |
<pre> |
||

2 = 3-(5+(7-11)) |
2 = 3-(5+(7-11)) |
||

Line 125: | Line 113: | ||

</pre> |
</pre> |
||

− | Solution: |
+ | [[99 questions/Solutions/93 | Solutions]] |

− | <haskell> |
||

− | module P93 where |
||

− | import Control.Monad |
||

− | import Data.List |
||

− | import Data.Maybe |
||

− | |||

− | type Equation = (Expr, Expr) |
||

− | -- cache value in binary expression |
||

− | data Expr = Const Integer | Binary Value Expr Op Expr |
||

− | deriving (Eq, Show) |
||

− | data Op = Plus | Minus | Multiply | Divide |
||

− | deriving (Bounded, Eq, Enum, Show) |
||

− | type Value = Rational |
||

− | |||

− | -- top-level function: all correct equations generated from the list of |
||

− | -- numbers, as pretty strings. |
||

− | puzzle :: [Integer] -> [String] |
||

− | puzzle ns = map (flip showsEquation "") (equations ns) |
||

− | |||

− | -- generate all correct equations from the list of numbers |
||

− | equations :: [Integer] -> [Equation] |
||

− | equations [] = error "empty list of numbers" |
||

− | equations [n] = error "only one number" |
||

− | equations ns = [(e1, e2) | |
||

− | (ns1, ns2) <- splits ns, |
||

− | e1 <- exprs ns1, e2 <- exprs ns2, |
||

− | value e1 == value e2] |
||

− | |||

− | -- generate all expressions from the numbers, except those containing |
||

− | -- a division by zero, or redundant right-associativity. |
||

− | exprs :: [Integer] -> [Expr] |
||

− | exprs [n] = [Const n] |
||

− | exprs ns = [Binary n e1 op e2 | (ns1, ns2) <- splits ns, |
||

− | e1 <- exprs ns1, e2 <- exprs ns2, op <- [minBound..maxBound], |
||

− | not (right_associative op e2), |
||

− | n <- maybeToList (apply op (value e1) (value e2))] |
||

− | |||

− | -- splittings of a list into two non-empty lists |
||

− | splits :: [a] -> [([a],[a])] |
||

− | splits xs = tail (init (zip (inits xs) (tails xs))) |
||

− | |||

− | -- the cached values of an expression |
||

− | value :: Expr -> Value |
||

− | value (Const n) = fromInteger n |
||

− | value (Binary n _ _ _) = n |
||

− | |||

− | -- applying an operator to arguments may fail (division by zero) |
||

− | apply :: Op -> Value -> Value -> Maybe Value |
||

− | apply Plus x y = Just (x + y) |
||

− | apply Minus x y = Just (x - y) |
||

− | apply Multiply x y = Just (x * y) |
||

− | apply Divide x 0 = Nothing |
||

− | apply Divide x y = Just (x / y) |
||

− | |||

− | -- e1 op (e2 op' e3) == (e1 op e2) op' e3 |
||

− | right_associative :: Op -> Expr -> Bool |
||

− | right_associative Plus (Binary _ _ Plus _) = True |
||

− | right_associative Plus (Binary _ _ Minus _) = True |
||

− | right_associative Multiply (Binary _ _ Multiply _) = True |
||

− | right_associative Multiply (Binary _ _ Divide _) = True |
||

− | right_associative _ _ = False |
||

− | |||

− | -- Printing of equations and expressions |
||

− | |||

− | showsEquation :: Equation -> ShowS |
||

− | showsEquation (l, r) = showsExprPrec 0 l . showString " = " . showsExprPrec 0 r |
||

− | |||

− | -- all operations are left associative |
||

− | showsExprPrec :: Int -> Expr -> ShowS |
||

− | showsExprPrec _ (Const n) = shows n |
||

− | showsExprPrec p (Binary _ e1 op e2) = showParen (p > op_prec) $ |
||

− | showsExprPrec op_prec e1 . showString (opName op) . |
||

− | showsExprPrec (op_prec+1) e2 |
||

− | where op_prec = precedence op |
||

− | |||

− | precedence :: Op -> Int |
||

− | precedence Plus = 6 |
||

− | precedence Minus = 6 |
||

− | precedence Multiply = 7 |
||

− | precedence Divide = 7 |
||

− | |||

− | opName :: Op -> String |
||

− | opName Plus = "+" |
||

− | opName Minus = "-" |
||

− | opName Multiply = "*" |
||

− | opName Divide = "/" |
||

− | </haskell> |
||

− | I've used rational division, because that's what the Prolog solution does. |
||

− | Unlike the Prolog solution, I've eliminated solutions like |
||

− | <tt>"1+(2+3) = 6"</tt> as a trivial variant of <tt>"1+2+3 = 6"</tt> (cf the function <tt>right_associative</tt>). |
||

− | Apart from that, the Prolog solution is shorter because it uses built-in evaluation and printing of expressions. |
||

== Problem 94 == |
== Problem 94 == |
||

− | <Problem description> |
+ | (***) Generate K-regular simple graphs with N nodes |

− | Example: |
+ | In a K-regular graph all nodes have a degree of K; i.e. the number of edges incident in each node is K. How many (non-isomorphic!) 3-regular graphs with 6 nodes are there? |

− | <pre> |
||

− | <example in lisp> |
||

− | </pre> |
||

− | Example in Haskell: |
+ | [https://prof.ti.bfh.ch/hew1/informatik3/prolog/p-99/p94.txt Sample results] |

− | <pre> |
||

− | <example in Haskell> |
||

− | </pre> |
||

Solution: |
Solution: |
||

Line 231: | Line 130: | ||

<description of implementation> |
<description of implementation> |
||

− | |||

− | == Problem 95 == |
||

− | |||

− | (**) English number words |
||

− | |||

− | On financial documents, like cheques, numbers must sometimes be written in full words. Example: 175 must be written as one-seven-five. Write a predicate full-words/1 to print (non-negative) integer numbers in full words. |
||

− | |||

− | Example in Haskell: |
||

− | <pre> |
||

− | > numbers 175 |
||

− | one-seven-five |
||

− | </pre> |
||

− | |||

− | Solution: |
||

− | <haskell> |
||

− | import Data.List |
||

− | import Data.Maybe |
||

− | |||

− | numbers :: Integer -> String |
||

− | numbers n = concat . intersperse "-" . map (fromJust . (`lookup` table)) $ show n |
||

− | where table = [('0',"zero"), ('1',"one"), ('2',"two"), ('3',"three"), ('4',"four"), |
||

− | ('5',"five"), ('6',"six"), ('7',"seven"), ('8',"eight"), ('9',"nine")] |
||

− | </haskell> |
||

− | |||

− | This solution does a simple table lookup after converting the positive integer into a string. Thus dividing into digits is much simplified. |
||

− | |||

− | == Problem 96 == |
||

− | |||

− | (**) Syntax checker |
||

− | |||

− | In a certain programming language (Ada) identifiers are defined by the [http://www.hta-bi.bfh.ch/~hew/informatik3/prolog/p-99/p96.gif syntax diagram]. Transform the syntax diagram into a system of syntax diagrams which do not contain loops; i.e. which are purely recursive. Using these modified diagrams, write a predicate identifier/1 that can check whether or not a given string is a legal identifier. |
||

− | |||

− | Example in Prolog: |
||

− | <pre> |
||

− | % identifier(Str) :- Str is a legal identifier |
||

− | </pre> |
||

− | |||

− | Example in Haskell: |
||

− | <pre> |
||

− | > identifier "this-is-a-long-identifier" |
||

− | True |
||

− | > identifier "this-ends-in-" |
||

− | False |
||

− | > identifier "two--hyphens" |
||

− | False |
||

− | </pre> |
||

− | |||

− | Solution: |
||

− | <haskell> |
||

− | identifier [] = False |
||

− | identifier (x:xs) = letter x && loop xs |
||

− | where loop [] = True |
||

− | loop (x':xs') | x' == '-' = (not . null) xs' && (letter (head xs') || digit (head xs')) && loop (tail xs') |
||

− | | letter x' = loop xs' |
||

− | | digit x' = loop xs' |
||

− | | otherwise = False |
||

− | letter x = x `elem` (['a'..'z'] ++ ['A'..'Z']) |
||

− | digit x = x `elem` ['0'..'9'] |
||

− | </haskell> |
||

− | |||

− | Simple functional transcription of the diagram. |
||

− | |||

− | Another direct transcription of the diagram: |
||

− | <haskell> |
||

− | identifier :: String -> Bool |
||

− | identifier (c:cs) = isLetter c && hyphen cs |
||

− | where hyphen [] = True |
||

− | hyphen ('-':cs) = alphas cs |
||

− | hyphen cs = alphas cs |
||

− | alphas [] = False |
||

− | alphas (c:cs) = isAlpha c && hyphen cs |
||

− | </haskell> |
||

− | The functions <tt>hyphen</tt> and <tt>alphas</tt> correspond to states in the automaton at the start of the loop and before a compulsory alphanumeric, respectively. |
||

− | == Problem 97 == |
||

− | |||

− | (**) Sudoku |
||

− | |||

− | Sudoku puzzles go like this: |
||

− | |||

− | <pre> |
||

− | Problem statement Solution |
||

− | |||

− | . . 4 | 8 . . | . 1 7 9 3 4 | 8 2 5 | 6 1 7 |
||

− | | | | | |
||

− | 6 7 . | 9 . . | . . . 6 7 2 | 9 1 4 | 8 5 3 |
||

− | | | | | |
||

− | 5 . 8 | . 3 . | . . 4 5 1 8 | 6 3 7 | 9 2 4 |
||

− | --------+---------+-------- --------+---------+-------- |
||

− | 3 . . | 7 4 . | 1 . . 3 2 5 | 7 4 8 | 1 6 9 |
||

− | | | | | |
||

− | . 6 9 | . . . | 7 8 . 4 6 9 | 1 5 3 | 7 8 2 |
||

− | | | | | |
||

− | . . 1 | . 6 9 | . . 5 7 8 1 | 2 6 9 | 4 3 5 |
||

− | --------+---------+-------- --------+---------+-------- |
||

− | 1 . . | . 8 . | 3 . 6 1 9 7 | 5 8 2 | 3 4 6 |
||

− | | | | | |
||

− | . . . | . . 6 | . 9 1 8 5 3 | 4 7 6 | 2 9 1 |
||

− | | | | | |
||

− | 2 4 . | . . 1 | 5 . . 2 4 6 | 3 9 1 | 5 7 8 |
||

− | </pre> |
||

− | |||

− | Every spot in the puzzle belongs to a (horizontal) row and a (vertical) column, as well as to one single 3x3 square (which we call "square" for short). At the beginning, some of the spots carry a single-digit number between 1 and 9. The problem is to fill the missing spots with digits in such a way that every number between 1 and 9 appears exactly once in each row, in each column, and in each square. |
||

− | |||

− | Solutions: see [[Sudoku]] |
||

− | |||

− | == Problem 98 == |
||

− | |||

− | <Problem description> |
||

− | |||

− | Example: |
||

− | <pre> |
||

− | <example in lisp> |
||

− | </pre> |
||

− | |||

− | Example in Haskell: |
||

− | <pre> |
||

− | <example in Haskell> |
||

− | </pre> |
||

− | |||

− | Solution: |
||

− | <haskell> |
||

− | <solution in haskell> |
||

− | </haskell> |
||

− | |||

− | <description of implementation> |
||

− | |||

− | == Problem 99 == |
||

− | |||

− | (***) Crossword puzzle |
||

− | |||

− | Given an empty (or almost empty) framework of a crossword puzzle and a set of words. The problem is to place the words into the framework. |
||

− | |||

− | The particular crossword puzzle is specified in a text file which first lists the words (one word per line) in an arbitrary order. Then, after an empty line, the crossword framework is defined. In this framework specification, an empty character location is represented by a dot (.). In order to make the solution easier, character locations can also contain predefined character values. The puzzle opposite is defined in the file [http://www.hta-bi.bfh.ch/~hew/informatik3/prolog/p-99/p99a.dat p99a.dat], other examples are [http://www.hta-bi.bfh.ch/~hew/informatik3/prolog/p-99/p99b.dat p99b.dat] and [http://www.hta-bi.bfh.ch/~hew/informatik3/prolog/p-99/p99d.dat p99d.dat]. There is also an example of a puzzle ([http://www.hta-bi.bfh.ch/~hew/informatik3/prolog/p-99/p99c.dat p99c.dat]) which does not have a solution. |
||

− | |||

− | Words are strings (character lists) of at least two characters. A horizontal or vertical sequence of character places in the crossword puzzle framework is called a site. Our problem is to find a compatible way of placing words onto sites. |
||

− | |||

− | Hints: (1) The problem is not easy. You will need some time to thoroughly understand it. So, don't give up too early! And remember that the objective is a clean solution, not just a quick-and-dirty hack! |
||

− | |||

− | (2) Reading the data file is a tricky problem for which a solution is provided in the file [http://www.hta-bi.bfh.ch/~hew/informatik3/prolog/p-99/p99-readfile.pl p99-readfile.pl]. See the predicate read_lines/2. |
||

− | |||

− | (3) For efficiency reasons it is important, at least for larger puzzles, to sort the words and the sites in a particular order. For this part of the problem, the solution of P28 may be very helpful. |
||

− | |||

− | Example in Haskell: |
||

− | <pre> |
||

− | </pre> |
||

− | |||

− | Solution: |
||

− | <haskell> |
||

− | </haskell> |
||

[[Category:Tutorials]] |
[[Category:Tutorials]] |

## Revision as of 17:08, 15 July 2010

This is part of Ninety-Nine Haskell Problems, based on Ninety-Nine Prolog Problems.

If you want to work on one of these, put your name in the block so we know someone's working on it. Then, change n in your block to the appropriate problem number, and fill in the <Problem description>,<example in Haskell>,<solution in haskell> and <description of implementation> fields.

## 1 Miscellaneous problems

## 2 Problem 90

(**) Eight queens problem

This is a classical problem in computer science. The objective is to place eight queens on a chessboard so that no two queens are attacking each other; i.e., no two queens are in the same row, the same column, or on the same diagonal.

Hint: Represent the positions of the queens as a list of numbers 1..N. Example: [4,2,7,3,6,8,5,1] means that the queen in the first column is in row 4, the queen in the second column is in row 2, etc. Use the generate-and-test paradigm.

Example in Haskell:

> length (queens 8) 92 > head (queens 8) [1,5,8,6,3,7,2,4]

## 3 Problem 91

(**) Knight's tour

Another famous problem is this one: How can a knight jump on an NxN chessboard in such a way that it visits every square exactly once? A set of solutions is given on the The_Knights_Tour page.

Hints: Represent the squares by pairs of their coordinates of the form X/Y, where both X and Y are integers between 1 and N. (Note that '/' is just a convenient functor, not division!) Define the relation jump(N,X/Y,U/V) to express the fact that a knight can jump from X/Y to U/V on a NxN chessboard. And finally, represent the solution of our problem as a list of N*N knight positions (the knight's tour).

There are two variants of this problem:

- find a tour ending at a particular square
- find a circular tour, ending a knight's jump from the start (clearly it doesn't matter where you start, so choose (1,1))

Example in Haskell:

Knights> head $ knightsTo 8 (1,1) [(2,7),(3,5),(5,6),(4,8),(3,6),(4,4),(6,5),(4,6), (5,4),(7,5),(6,3),(5,5),(4,3),(2,4),(1,6),(2,8), (4,7),(6,8),(8,7),(6,6),(4,5),(6,4),(5,2),(7,1), (8,3),(6,2),(8,1),(7,3),(8,5),(7,7),(5,8),(3,7), (1,8),(2,6),(3,4),(1,5),(2,3),(3,1),(1,2),(3,3), (1,4),(2,2),(4,1),(5,3),(7,4),(8,2),(6,1),(4,2), (2,1),(1,3),(2,5),(1,7),(3,8),(5,7),(7,8),(8,6), (6,7),(8,8),(7,6),(8,4),(7,2),(5,1),(3,2),(1,1)] Knights> head $ closedKnights 8 [(1,1),(3,2),(1,3),(2,1),(3,3),(5,4),(6,6),(4,5), (2,6),(1,8),(3,7),(5,8),(4,6),(2,5),(4,4),(5,6), (6,4),(8,5),(7,7),(6,5),(5,3),(6,1),(4,2),(6,3), (8,2),(7,4),(5,5),(3,4),(1,5),(2,7),(4,8),(3,6), (1,7),(3,8),(5,7),(7,8),(8,6),(6,7),(8,8),(7,6), (8,4),(7,2),(5,1),(4,3),(3,5),(1,4),(2,2),(4,1), (6,2),(8,1),(7,3),(5,2),(7,1),(8,3),(7,5),(8,7), (6,8),(4,7),(2,8),(1,6),(2,4),(1,2),(3,1),(2,3)]

## 4 Problem 92

(***) Von Koch's conjecture

Several years ago I met a mathematician who was intrigued by a problem for which he didn't know a solution. His name was Von Koch, and I don't know whether the problem has been solved since.

Anyway the puzzle goes like this: Given a tree with N nodes (and hence N-1 edges). Find a way to enumerate the nodes from 1 to N and, accordingly, the edges from 1 to N-1 in such a way, that for each edge K the difference of its node numbers equals to K. The conjecture is that this is always possible.

For small trees the problem is easy to solve by hand. However, for larger trees, and 14 is already very large, it is extremely difficult to find a solution. And remember, we don't know for sure whether there is always a solution!

Write a predicate that calculates a numbering scheme for a given tree. What is the solution for the larger tree pictured below?

Example in Haskell:

> head $ vonKoch [(1,6),(2,6),(3,6),(4,6),(5,6),(5,7),(5,8),(8,9),(5,10),(10,11),(11,12),(11,13),(13,14)] [6,7,8,9,3,4,10,11,5,12,2,13,14,1]

## 5 Problem 93

(***) An arithmetic puzzle

Given a list of integer numbers, find a correct way of inserting arithmetic signs (operators) such that the result is a correct equation. Example: With the list of numbers [2,3,5,7,11] we can form the equations 2-3+5+7 = 11 or 2 = (3*5+7)/11 (and ten others!).

Division should be interpreted as operating on rationals, and division by zero should be avoided.

Example in Haskell:

P93> mapM_ putStrLn $ puzzle [2,3,5,7,11] 2 = 3-(5+7-11) 2 = 3-5-(7-11) 2 = 3-(5+7)+11 2 = 3-5-7+11 2 = (3*5+7)/11 2*(3-5) = 7-11 2-(3-(5+7)) = 11 2-(3-5-7) = 11 2-(3-5)+7 = 11 2-3+5+7 = 11

The other two solutions alluded to in the problem description are dropped by the Haskell solution as trivial variants:

2 = 3-(5+(7-11)) 2-3+(5+7) = 11

## 6 Problem 94

(***) Generate K-regular simple graphs with N nodes

In a K-regular graph all nodes have a degree of K; i.e. the number of edges incident in each node is K. How many (non-isomorphic!) 3-regular graphs with 6 nodes are there?

Solution:

<solution in haskell>

<description of implementation>