N-Queens in Prolog

[@audunstolpe7408]

These videos are a treasure trove.

[@HakanKjellerstrand]

Great explanation, Markus!

[@ThePowerOfProlog]

Thank you so much Hakan, I greatly appreciate your feedback! Enjoy!

[@stefankral1264]

around 19:50: "Prolog makes it easy to write slow programs." What a Prolog programmer actually hears: *generalizing...* "Prolog makes it easy to write ____ programs."

[@tgalaxy5550]

It’s a great explanation, thanks!

[@liuchuanyuan4301]

This is amazing. My uni lecturer recommended us to watch this. Thank you for sharing! I am a bit confused why maplist(between(1,N),Qs) would 'ground' the Qs.

[@ThePowerOfProlog]

Thank you a lot for your interest, and this very positive feedback! The recommendation of your lecturer, and interest from students, are a great honor for me! Try it out, for example with a single Q: ?- between(1, N, Q), assuming that N is instantiated. maplist/3 then lifts this relation to a list Qs of queens. Enjoy!

[@mahmoudashraf3761]

can you explain the flow free game as it is very confusing ?

[@Spectrum_Aerospacejet_Lab]

With a 22 row board you can find only a few solutions by hand.

[@ThePowerOfProlog]

I can barely find a solution for 8 rows by hand.