Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

Re: May be OT (Re: Solve Einstein's problem with perl?!)

by Anonymous Monk
on Feb 22, 2002 at 00:14 UTC ( #146837=note: print w/replies, xml ) Need Help??


in reply to May be OT (Re: Solve Einstein's problem with perl?!)
in thread Solve Einstein's problem with perl?!

I tried doing a similar puzzle with Prolog. Formulating it in Prolog took longer than for my wife to do it with graph paper. I suspect I could have done it with pencil and propositional calculus quicker; I had previously done another that way.

The final constraint

None of the 5 persons likes the same drink or cigarrete best or has the same pet as one of his neighbours.
is both the most unrealisitic (wrto Real World) and the one that is hardest to express in Prolog or other LP paradigms.

A reduction-based theorem-prover (as opposed to the unification based one that makes Prolog go) might have a better chance at meeting the rec.puzzles definition of "solving", as opposed to trying by exhaustion.

-- Bill

  • Comment on Re: May be OT (Re: Solve Einstein's problem with perl?!)

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://146837]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (2)
As of 2023-02-01 20:08 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I prefer not to run the latest version of Perl because:







    Results (13 votes). Check out past polls.

    Notices?