Day 25: Make it a visualization :)

Use `runghc` so it is slow enough to be pretty (`ghc -O3` will make it
go way too fast)

Author: Demindiro

2021/25/Main.hs

@@ -1,4 +1,5 @@
 import qualified Data.Array as A
+import Debug.Trace
 
 parse = (\(y,x,l) -> A.array ((0, 0), (y, x)) l)
       . (\l -> (maximum $ map (fst . fst) l, maximum $ map (snd . fst) l, l))
@@ -7,11 +8,11 @@ parse = (\(y,x,l) -> A.array ((0, 0), (y, x)) l)
       . map (zip [0..])
       . lines
 
-steps m = loop m
+steps m = loop $ trace ("\27[2J" ++ toStr (0,0) m) m
   where
     (my,mx) = snd $ A.bounds m
     loop m | m == m' = 1
-           | m /= m' = 1 + loop m'
+           | m /= m' = 1 + (loop $ trace ("\27[2J" ++ toStr (0,0) m') m')
       where
         n  = m A.// stepEW (0, 0)
         m' = n A.// stepNS (0, 0)
@@ -29,5 +30,9 @@ steps m = loop m
           | otherwise = ns
           where d = (succ y `mod` succ my, x)
                 ns = stepNS (y, x + 1)
+    toStr p@(y, x) m
+      | y > my = "\n"
+      | x > mx = '\n' : toStr (y + 1, 0) m
+      | otherwise = m A.! p : toStr (y, x + 1) m
 
 main = parse <$> readFile "input.txt" >>= print . steps