Comments on: N-Queens in Haskell

By: Haskell, Eight Queens puzzle « Komap’s Blog

Haskell, Eight Queens puzzle « Komap’s Blog — Sat, 18 Jul 2009 18:41:24 +0000

[...] magnus blog – N-Queens solution, relatively long, code translated from Standard ML, uses exceptions. There is another solution (in comments), 147bytes long [...]

By: dtldarek

dtldarek — Tue, 24 Feb 2009 03:24:42 +0000

try this: (147 bytes ^^) h l n x=if x==0 then[l]else do y<-[1..n];if null[0|(p,q)<-l,or[q==y,p+q==x+y,p-q==q-y]] then h((x,y):l)n$x-1 else[] main=putStr$show$head$h[]8 8

By: Some Basic Stuff: The Writer Monad « Sententia cdsmithus

Some Basic Stuff: The Writer Monad « Sententia cdsmithus — Sun, 09 Dec 2007 17:47:57 +0000

[...] Basic Stuff: The Writer Monad Filed under: Uncategorized — cdsmith @ 11:47 am In this post, Magnus Therning gives a number of solutions to the n-queens problem in Haskell. The problem [...]

By: Derek Elkins

Derek Elkins — Sun, 09 Dec 2007 00:14:20 +0000

You can implement threatens just like it is in the SML or just like you would in C-style languages.

threatens (i, j) (i', j') = i == i' || j == j' || i+j == i'+j' || i-j == i'-j'