Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine
 
PerlMonks  

Re: Parks Puzzle

by davies (Parson)
on Jan 17, 2018 at 08:46 UTC ( #1207401=note: print w/replies, xml ) Need Help??


in reply to Parks Puzzle

I don't know this particular puzzle, but whenever I see anything that might involve trial & error, I consider Dancing Links (https://en.wikipedia.org/wiki/Dancing_Links). Masak gave a talk on this to the London Perl Workshop >5 years ago. It is probably on line somewhere, but I have no idea where. He used Perl 6 in his examples, but the techniques were certainly obvious to me.

Regards,

John Davies

Update: having had a VERY quick look at the site (it's not something I want to get), my first thought is that it is a variant on the N queens problem. See, for example, Efficient N-Queen solution with Perl.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1207401]
help
Chatterbox?
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (6)
As of 2018-07-20 07:05 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    It has been suggested to rename Perl 6 in order to boost its marketing potential. Which name would you prefer?















    Results (426 votes). Check out past polls.

    Notices?