Różnice

Różnice między wybraną wersją a wersją aktualną.

Odnośnik do tego porównania

pl:prolog:pllib:hanoi_2 [2019/06/27 15:50] (aktualna)
Linia 1: Linia 1:
 +====== Hanoi 2 ======
 +{{tag>​problem_solving}}
 +===== Description =====
 +Towers of Hanoi using a memo-function
 +
 +**Source**: ​ The Art of Prolog
 +===== Download =====
 +Program source code: {{hanoi_2.pl}}
 +===== Listing =====
 +<code prolog>
 +/*
 + hanoi(N,​A,​B,​C,​Moves) :-
 + Moves is the sequence of moves required to move N discs
 + from peg A to peg B using peg C as an intermediary
 + according to the rules of the Towers of Hanoi puzzle
 +*/
 +
 + :- op(100, xfx, [to]).
 +
 + hanoi(1,​A,​B,​C,​[A to B]).
 + hanoi(N,​A,​B,​C,​Moves) :-
 + N > 1,
 + N1 is N -1,
 + lemma(hanoi(N1,​A,​C,​B,​Ms1)),​
 + hanoi(N1,​C,​B,​A,​Ms2),​
 + append(Ms1,​[A to B|Ms2],​Moves).
 +
 + lemma(P):- P, asserta((P :- !)).
 +
 + /* Testing */
 +
 + test_hanoi(N,​Pegs,​Moves) :-
 + hanoi(N,​A,​B,​C,​Moves),​ Pegs = [A,B,C].
 +
 +% Program 12.3: Towers of Hanoi using a memo-function
 +</​code>​
 +===== Comments =====
  
pl/prolog/pllib/hanoi_2.txt · ostatnio zmienione: 2019/06/27 15:50 (edycja zewnętrzna)
www.chimeric.de Valid CSS Driven by DokuWiki do yourself a favour and use a real browser - get firefox!! Recent changes RSS feed Valid XHTML 1.0