箱玉系（ソリトン Cellular Automaton） - Qiita

import Data.List (span) main = mapM_ (putStrLn . draw) . take 20 . iterate step . initialize $ dat where draw = map (\n -> if n == 0 then ' ' else '■') dat = [1,2,3,7,8,12,13,18] initialize :: [Int] -> [Int] initialize = ini [] (-1) where ini acc _ [] = reverse acc ini acc prev (x:xs) = ini (make (x-prev)++acc) x xs make n = (1:) . take (n-1) . repeat $ 0 step ns = step' [] ns where step' acc [] =

[lotz84]

Haskell実装。超離散化の話とか解説して欲しい