\p -> square p <= n It’s an unnamed (anonymous) function that accepts variable p, squares it and compares result with n. all (\p -> not $ divideBy p n) testingSlice checks that anonymous function returns true value for each element in testingSlice. Read about lambdas.
It works like a foreach loop, so foreach (x in [1..3]) { foreach (y in [x .. x * 2]) { yield y; } } First x is 1, so y in [1 .. 2] Then x is 2, so y in [2 .. 4] Then x is 3, so y in [3 .. 6] … Read more
Making a guess at what your current code does, here’s a proposal for an algorithm: nondeterministically pick a permutation of the vowels assign indices to the permutation use the standard tails trick to nondeterministically choose the appropriate number of elements from this list In code: import Data.List choose :: Int -> [a] -> [[a]] choose … Read more
You need to transform the input grid into the output grid by mapping a function over each cell of the grid. The mapping function is going to need the coordinates of the cell and the content of the cell. The coordinates are needed to see if the other player fired at that location, and the … Read more