A simple digital circuit for the Towers of Hanoi problem

被引：0

作者：

Blair, GM

机构：

[1] Department of Electrical Engineering, University of Edinburgh, Edinburgh

来源：

IEEE TRANSACTIONS ON EDUCATION | 1997年 / 40卷 / 04期

关键词：

digital circuit design; Towers of Hanoi problem;

D O I：

10.1109/13.650843

中图分类号：

G40 [教育学];

学科分类号：

040101 ; 120403 ;

摘要：

A digital circuit is presented for the Towers of Hanoi problem based upon its iterative algorithm, This provides a case study to illustrate synchronous design principles and the correspondence between hardware and software functions.

引用

页码：287 / 288

页数：2

共 50 条

[21] THE TOWERS OF HANOI PROBLEM WITH CYCLIC PARALLEL MOVES
WU, JS
CHEN, RJ
INFORMATION PROCESSING LETTERS, 1993, 46 (01) : 1 - 6
[22] AN ITERATIVE ALGORITHM FOR THE CYCLIC TOWERS OF HANOI PROBLEM
ER, MC
INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1984, 13 (02): : 123 - 129
[23] A SIMPLER ITERATIVE SOLUTION TO THE TOWERS OF HANOI PROBLEM
FRANKLIN, WR
SIGPLAN NOTICES, 1984, 19 (08): : 87 - 88
[24] The Towers of Hanoi
Morris, George C.
TEACHING MATHEMATICS AND ITS APPLICATIONS, 2007, 26 (04): : 179 - 186
[25] A LOOPLESS AND OPTIMAL ALGORITHM FOR THE CYCLIC TOWERS OF HANOI PROBLEM
ER, MC
INFORMATION SCIENCES, 1987, 42 (03) : 283 - 287
[26] “Problem of Towers of Hanoi”仿真软件的设计
周斌
实验室研究与探索, 2011, 30 (07) : 61 - 63+71
[27] Fast iterative algorithm for solving the Towers of Hanoi problem
Chang Sha Tie Dao Xue Yuan, 3 (39-43):
[28] THE SUPER TOWERS OF HANOI PROBLEM - LARGE RINGS ON SMALL RINGS
KLEIN, CS
MINSKER, S
DISCRETE MATHEMATICS, 1993, 114 (1-3) : 283 - 295
[29] A LOOPLESS APPROACH FOR CONSTRUCTING A FASTEST ALGORITHM FOR THE TOWERS OF HANOI PROBLEM
ER, MC
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1986, 20 (01) : 49 - 54
[30] PERFORMANCE EVALUATIONS OF RECURSIVE AND ITERATIVE ALGORITHMS FOR THE TOWERS OF HANOI PROBLEM
ER, MC
COMPUTING, 1986, 37 (02) : 93 - 102

← 1 2 3 4 5 →