Randomness is a bit of a strange concept in Haskell.
As I discovered writing about Haskell and Randomness a few weeks ago, the best way to avoid doing everything inside the IO monad is to write functions that always return the random generator.
The crux of the matter is that random generators are long mathematical sequences. If you keep using the same index, you'll keep getting the same "random" value. You have to make sure the random generator progresses.
Increasing a number by a random value would look something like this:
import System.Random
addRand::(RandomGen g) => g -> Int -> (g, Int)
addRand gen x = let (a, gen') = randomR (0, 20) gen
in (gen', x+a)
main = do
generator <- newStdGen
print $ snd $ addRand generator 5
-- prints 15
While this approach is great for changing a single value, it breaks down when you try to randomly change a whole list:
print $ map (snd . (addRand generator)) [1,1,1,1]
-- prints [11,11,11,11]
Bummer! We applied a random function to every list member. And got a list of identical values!
The problem is that every time addRand gets called, it uses the same random generator. This means we're always using the same number in the random generator series.
We need a way to perform a fold and a map at the same time. A map, so the function is applied to every list item and we get a new list, and a fold where the generator is used as the accumulator.
We might be tempted to write something like this monstrosity:
addRand'::(RandomGen g) => g -> [Int] -> [(g, Int)]
addRand' gen [x] = [addRand gen x]
addRand' gen (x:xs) = let (gen', x') = addRand gen x
in (gen', x'):(addRand' gen' xs)
-- and then in main
print $ map (snd) $ addRand' generator [1,1,1,1]
-- prints [11,3,13,14]
This works. Every number in the list is different!
But the code is somewhat terrible and difficult to reason about.
Luckily, Haskell has got us covered and comes with a standard function called mapAccumL, which is a combination of a fold and a map:
print $ snd $ mapAccumL addRand generator [1,1,1,1]
-- prints [11,3,13,14]
Cleaner, less work, more obvious what's going on. And it just happens to be perfect for writing evolutionary algorithms in Haskell. But more on that later, hopefully as early as Friday.
Here's the whole code:
import System.Random
import Data.List
addRand::(RandomGen g) => g -> Int -> (g, Int)
addRand gen x = let (a, gen') = randomR (0, 20) gen
in (gen', x+a)
addRand'::(RandomGen g) => g -> [Int] -> [(g, Int)]
addRand' gen [x] = [addRand gen x]
addRand' gen (x:xs) = let (gen', x') = addRand gen x
in (gen', x'):(addRand' gen' xs)
main = do
generator <- newStdGen
print $ snd $ addRand generator 5
-- prints 15
print $ map (snd . (addRand generator)) [1,1,1,1]
-- prints [11,11,11,11]
print $ map (snd) $ addRand' generator [1,1,1,1]
-- prints [11,3,13,14]
print $ snd $ mapAccumL addRand generator [1,1,1,1]
-- prints [11,3,13,14]
Continue reading about An elegant way to randomly change every list member in Haskell
Semantically similar articles hand-picked by GPT-4
- Haskell and randomness
- Markov chain poem trainer+generator in 29 sloc of Haskell
- Collatz, Haskell and Memoization
- Week 15: A tutorial on the expressiveness and universality of fold
- Implementing a weighed random choice in Clojure
Learned something new?
Read more Software Engineering Lessons from Production
I write articles with real insight into the career and skills of a modern software engineer. "Raw and honest from the heart!" as one reader described them. Fueled by lessons learned over 20 years of building production code for side-projects, small businesses, and hyper growth startups. Both successful and not.
Subscribe below 👇
Software Engineering Lessons from Production
Join Swizec's Newsletter and get insightful emails 💌 on mindsets, tactics, and technical skills for your career. Real lessons from building production software. No bullshit.
"Man, love your simple writing! Yours is the only newsletter I open and only blog that I give a fuck to read & scroll till the end. And wow always take away lessons with me. Inspiring! And very relatable. 👌"
Have a burning question that you think I can answer? Hit me up on twitter and I'll do my best.
Who am I and who do I help? I'm Swizec Teller and I turn coders into engineers with "Raw and honest from the heart!" writing. No bullshit. Real insights into the career and skills of a modern software engineer.
Want to become a true senior engineer? Take ownership, have autonomy, and be a force multiplier on your team. The Senior Engineer Mindset ebook can help 👉 swizec.com/senior-mindset. These are the shifts in mindset that unlocked my career.
Curious about Serverless and the modern backend? Check out Serverless Handbook, for frontend engineers 👉 ServerlessHandbook.dev
Want to Stop copy pasting D3 examples and create data visualizations of your own? Learn how to build scalable dataviz React components your whole team can understand with React for Data Visualization
Want to get my best emails on JavaScript, React, Serverless, Fullstack Web, or Indie Hacking? Check out swizec.com/collections
Did someone amazing share this letter with you? Wonderful! You can sign up for my weekly letters for software engineers on their path to greatness, here: swizec.com/blog
Want to brush up on your modern JavaScript syntax? Check out my interactive cheatsheet: es6cheatsheet.com
By the way, just in case no one has told you it yet today: I love and appreciate you for who you are ❤️