Analysis of Recurrence Relations Generalized from the 4-Peg Tower of Hanoi

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, we analyze recurrence relations generalized from the Tower of Hanoi problem of the form T(n,α,β)=min1≤t≤n{αT(n-t,α,β)+βS(t,3)}, where S(t,3)=2t-1 is the optimal total number of moves for the 3-peg Tower of Hanoi problem. It is shown that when α and β are natural numbers, the sequence of differences of T(n,α,β)s, i.e., {T(n,α,β)-T(n-1,α,β)}, consists of numbers of the form β2iαj (i,j≥0) lined in the increasing order.

著者

• MATSUURA Akihiro

  School of Science and Engineering, Tokyo Denki University

• Matsuura Akihiro

  School Of Informatics Kyoto University

関連論文

• Analysis of Recurrence Relations Generalized from the 4-Peg Tower of Hanoi
• Solving SAT Efficiently with Promises (Special Issue on Selected Papers from LA Symposium)

スポンサーリンク