Magic squares of doubly even order: Difference between revisions
Content added Content deleted
(→{{header|Haskell}}: (added test)) |
(→{{header|Haskell}}: Adding comments, and a shorter route where order N is a power of 2) |
||
Line 283:
<lang Haskell>import Data.List (transpose)
magicSquare :: Int -> [[Int]]
magicSquare n
| (rem n 4) > 0 = []
| otherwise = splitEvery n $
-- and from the
zipWith (\x i -> if x then i else limit
[1..sqr]
where
scale = replicate $ quot n 4▼
sqr = n * n
limit = sqr + 1
series
-- For powers of 2, the (append not) 'magic' series directly
-- yields the truth table that we need
| isPowerOf 2 n =
magicSeries $ floor (logBase 2 (fromIntegral sqr)) + 1
-- where n is not a power of 2, we can replicate a
-- minimum truth table, horizontally and vertically
| otherwise = (concat $ concat $ concat $
scale $ fmap scale $ splitEvery 4 $ magicSeries 5)
▲ where scale = replicate $ quot n 4
------------------------------------------------------------------------
magicSeries :: Int -> [Bool]
magicSeries n
Line 304 ⟶ 317:
where
xs = magicSeries (n - 1)
splitEvery :: Int -> [a] -> [[a]]
splitEvery n xs
Line 311 ⟶ 324:
where
(gp, t) = splitAt n xs
isPowerOf :: Int -> Int -> Bool
isPowerOf k n =
(until (\x -> (rem x k) /= 0)
(\x -> quot x k ) n) == 1
main :: IO ()
main = mapM_ (putStrLn . show) $ magicSquare 8
----------------------------------------------------------------------
-- Summed and checked
checked :: Int -> (Int, Bool)
Line 325 ⟶ 343:
(transpose square) ++ -- cols
(diagonals square) -- diagonals
diagonals :: [[Int]] -> [[Int]]
diagonals xs =
map (\x -> zipWith (!!) x [0..]) [xs, reverse xs]
main2 :: IO ()
main2 = putStrLn $ show (checked 8)</lang>
| |||