Towers of Hanoi: Difference between revisions
m
→{{header|J}}: formating
(→{{header|NewLISP}}: changed name) |
m (→{{header|J}}: formating) |
||
Line 491:
=={{header|J}}==
'''Solutions'''
<lang j>H =: i.@,&2 ` (({&0 2 1,0 2,{&1 0 2)@$:@<:) @. * NB. tacit using anonymous recursion
H1=: monad define NB. explicit equivalent of H
if. y do.
({&0 2 1 , 0 2 , {&1 0 2) H1 y-1
Line 500 ⟶ 501:
end.
)</lang>
'''Example use'''
<lang j> H 3
0 2
Line 511 ⟶ 512:
The result is a 2-column table; a row <tt>i,j</tt> is interpreted as: move a disk (the top disk) from peg <tt>i</tt> to peg<tt> j</tt> .
'''Alternative solution'''<br>
<lang J>hanoi=: monad define
moves=. i.@,&2 ` (({&0 2 1,0 2,{&1 0 2)@$:@<:) @. * y
disks=. $~` ((],[,]) $:@<:) @.* y
Line 520 ⟶ 522:
For example:
<lang J> hanoi 3
move disk 1 from peg 1 to peg 3
| |||