Dinesman's multiple-dwelling problem: Difference between revisions

Dinesman's multiple-dwelling problem (view source)

52 bytes removed , 13 years ago

m

→‎{{header|Prolog}}: Prolog is THE language for this kind of puzzle? Lets judge the code.

Anonymous user

Revision as of 12:06, 30 June 2011 (view source) rosettacode>Trap D (→‎{{header\|PureBasic}}) ← Older edit		Revision as of 14:04, 30 June 2011 (view source) rosettacode>Paddy3118 m (→‎{{header\|Prolog}}: Prolog is THE language for this kind of puzzle? Lets judge the code.) Newer edit →
Line 330: =={{header\|Prolog}}== ~~Prolog is THE language for this kind of puzzle !<br>~~ Works with SWI-Prolog and library(clpfd) written by '''Markus Triska'''. Line 429 ⟶ 428: true ==> predicate succeeded. <br> false ==> no other solution. =={{header\|PureBasic}}== <lang PureBasic>Prototype cond(Array t(1))