N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 4

Published: 04 Oct 2021

Description: view

Slideshow: view

All slides : view

Download: pdf (for a perfect viewing experience - see the slides as they are meant to be seen)

Speakerdeck: slideshow - 50 views - uploaded 23 Jul 2023

Slideshare: slideshow - 499 views - uploaded 04 Oct 2021

Page Impressions: 184 (since Feb 2024)

PDF Downloads: 51 (since Feb 2024)

(since Feb 2024)

See how feeding FP workhorses map and filter with monadic steroids turns them into the intriguing mapM and filterM.
Graduate to foldM by learning how it behaves with the help of three simple yet instructive examples of its usage.
Use the powers of foldM to generate all permutations of a collection with a simple one-liner.
Exploit what you learned about foldM to solve the N-Queens Combinatorial Problem with an iterative approach rather than a recursive one.