Revision as of 19:50, 7 October 2019 (view source) Hout (talk \| contribs) (→‎{{header\|Haskell}}: Added a first Haskell draft) ← Older edit		Revision as of 19:54, 7 October 2019 (view source) Hout (talk \| contribs) m (→‎{{header\|Haskell}}) Newer edit →
Line 443: Defining a unit movement of the interlocking wheels as a recursive descent, terminating at the first digit found, and printing a map-~~accumulating~~accumulation ~~with~~of that recursion over a list of given length but arbitrary content. <lang haskell>import qualified Data.Map.Strict as M

Intersecting number wheels (view source)