Lab 5

[BertLisser]

Exercise 2. Very good but refactoring can be more complete.
In many more places is it possible to replace Constraints by [Position]

type Node = (Sudoku,[Position])
prune :: (Row,Column,Value)
-> [Position] -> [Position]
constraints :: Sudoku -> [Position]

Exercise 4.

randomSudoku :: IO ()
randomSudoku = do [r] <- rsolveNs [emptyN]
                  showNode r
                  sudokuEmptyblocks <- deleteBlocks r
                  s <- genProblem sudokuEmptyblocks --making this a sudoku problem
                  showNode s
                  print (uniqueSol s)   --- this must be added. Otherwise you cannot see 
--- that the solution is unique