>>315
内視鏡バイト後に嫁とスーパーに買い物に行って昼ご飯を食べながら
hanoiの塔のソルバー(Wolfram版)完成。
Wolfram言語の使える東大卒やエリート高校生による検証を希望します。


Wolfram Language 14.0.0 Engine for Microsoft Windows (64-bit)
Copyright 1988-2023 Wolfram Research, Inc.

In[1]:= hanoi[n_,from_:"A",via_:"B",to_:"C"] :=(If[n>=1,hanoi[n-1,from,to,via];Print["move ",n, " from ",from, " to ",to];hanoi[n-1,via,from,to]])

In[2]:= hanoi[4]
move 1 from A to B
move 2 from A to C
move 1 from B to C
move 3 from A to B
move 1 from C to A
move 2 from C to B
move 1 from A to B
move 4 from A to C
move 1 from B to C
move 2 from B to A
move 1 from C to A
move 3 from B to C
move 1 from A to B
move 2 from A to C
move 1 from B to C