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

Published: 22 Aug 2021

Uploaded: 03 Dec 2023

Number of slides: 27

Description: view

Slideshow: view - 352 views

All slides : view

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

Speakerdeck: slideshow - 96 views - uploaded 23 Jul 2023

Slideshare: slideshow - 867 views - uploaded 22 Aug 2021

Scala Code: github repo

352

	36		52		31

Learn how to write FP code that displays a graphical representation of all the numerous N-Queens solutions for N=4,5,6,7,8.
See how to neatly solve the problem by exploiting its self-similarity and using a divide and conquer approach.
See how to write the equivalent Haskell program using the Gloss graphics library.
Make light work of assembling multiple images into a whole, by exploiting Doodle’s facilities for combining images using a relative layout.
See relevant FP functions, like Foldable’s intercalate and intersperse, in action.