This is a bit off-topic (though it is about N-queens) but I've long wanted to
ask people if an idea I had once is a well-known one. It once occurred to me
that solutions to N-rooks can be viewed as linear transformations that
correspond to permutations of a vector. So, then I wondered to what so
t...@gmail.com]
> Sent: sábado, 12 de marzo de 2016 23:33
> To: Jos Koot
> Cc: Racket Users
> Subject: Re: [racket-users] Sequential vs. Parallel 13-Queens program
>
> The code is a little difficult for me to read. It doesn't seem to collect
> *all* solutions for a giv
)),
because only rows (or cullums) are considered, not all N^2 squares of the
board.
Jos
-Original Message-
From: Brian Adkins [mailto:lojicdot...@gmail.com]
Sent: sábado, 12 de marzo de 2016 23:33
To: Jos Koot
Cc: Racket Users
Subject: Re: [racket-users] Sequential vs. Parallel 13-Queens
symmetrical problems.
Best wishes, Jos
-Original Message-
From: Brian Adkins [mailto:lojicdot...@gmail.com]
Sent: sábado, 12 de marzo de 2016 23:33
To: Jos Koot
Cc: Racket Users
Subject: Re: [racket-users] Sequential vs. Parallel 13-Queens program
The code is a little difficult for me
symmetrical problems.
Best wishes, Jos
-Original Message-
From: Brian Adkins [mailto:lojicdot...@gmail.com]
Sent: sábado, 12 de marzo de 2016 23:33
To: Jos Koot
Cc: Racket Users
Subject: Re: [racket-users] Sequential vs. Parallel 13-Queens program
The code is a little difficult for me to
The code is a little difficult for me to read. It doesn't seem to collect *all*
solutions for a given N. If that's the case, would you be able to modify it to
do so to allow a more direct comparison?
> On Mar 12, 2016, at 1:19 PM, Jos Koot wrote:
>
> See https://en.wikipedia.org/wiki/Eight_que
See https://en.wikipedia.org/wiki/Eight_queens_puzzle
For a non recursive non-back-tracking algorithm.
It is a loop that (when using a vector) can easily be unrolled in parallelly
executed loops.
I implemented it as follows running on 2 processors:
#lang racket
#|
The following text is copied from
7 matches
Mail list logo
