The Classical Tower of Hanoi Problem and Its Generalizations Vol. 1:: Multi-Peg Generalization

 
9783848403394: The Classical Tower of Hanoi Problem and Its Generalizations Vol. 1:: Multi-Peg Generalization
View all copies of this ISBN edition:
 
 

This book deals with the theoretical and the computational aspects of the classical Tower of Hanoi Problem (THP) and its multi-peg generalization. ·Chapter 1 reviews the classical THP in its general form with n(≥1) discs and 3 pegs, with the algorithms, both recursive and iterative. ·Chapter 2 considers the multi-peg generalization with n discs and p pegs, and gives some local-value relationships satisfied by M(n,p), kmin(n,p) and kmax(n,p), where M(n,p) is the presumed minimum number of moves, and kmin(n,p) and kmax(n,p) are the optimal partition numbers, and presents a recursive algorithm ·Chapter 3 gives the closed-form expressions for M(n,4), kmin(n,4) and kmax(n,4), and gives an iterative algorithm based on the divide-and-conquer approach. It is shown that, for n≥6, the presumed minimum solution is the optimal solution. ·Chapter 4 extends the results of Chapter 3 to find the explicit forms of M(n,p), kmin(n,p) and kmax(n,p), and establishes the equivalence of four formulations of the multi-peg THP. The divide-and-conquer approach has also been extended.

"synopsis" may belong to another edition of this title.

About the Author:

After graduating with Honours in Mathematics from Dhaka University, Bangladesh, the author then completed M.Sc. in Applied Mathematics and M.Sc. in Theoretical Physics from the same university. He then continued his higher studies in Japan under the Japanese Government Scholarship for M.Eng. and Ph.D. in Mathematical Sciences from Osaka University.

"About this title" may belong to another edition of this title.

Buy New View Book
List Price: US$ 78.00
US$ 64.36

Convert currency

Shipping: US$ 3.44
From Germany to U.S.A.

Destination, rates & speeds

Add to Basket

Top Search Results from the AbeBooks Marketplace

1.

Majumdar, A. A. K.
ISBN 10: 3848403390 ISBN 13: 9783848403394
New Quantity Available: 1
Seller:
Rating
[?]

Book Description Condition: New. Publisher/Verlag: LAP Lambert Academic Publishing | Multi-Peg Generalization | This book deals with the theoretical and the computational aspects of the classical Tower of Hanoi Problem (THP) and its multi-peg generalization. Chapter 1 reviews the classical THP in its general form with n( 1) discs and 3 pegs, with the algorithms, both recursive and iterative. Chapter 2 considers the multi-peg generalization with n discs and p pegs, and gives some local-value relationships satisfied by M(n,p), kmin(n,p) and kmax(n,p), where M(n,p) is the presumed minimum number of moves, and kmin(n,p) and kmax(n,p) are the optimal partition numbers, and presents a recursive algorithm Chapter 3 gives the closed-form expressions for M(n,4), kmin(n,4) and kmax(n,4), and gives an iterative algorithm based on the divide-and-conquer approach. It is shown that, for n 6, the presumed minimum solution is the optimal solution. Chapter 4 extends the results of Chapter 3 to find the explicit forms of M(n,p), kmin(n,p) and kmax(n,p), and establishes the equivalence of four formulations of the multi-peg THP. The divide-and-conquer approach has also been extended. | Format: Paperback | Language/Sprache: english | 251 gr | 220x150x9 mm | 156 pp. Seller Inventory # K9783848403394

More information about this seller | Contact this seller

Buy New
US$ 64.36
Convert currency

Add to Basket

Shipping: US$ 3.44
From Germany to U.S.A.
Destination, rates & speeds

2.

A. A. K. Majumdar
Published by LAP Lambert Academic Publishing Feb 2012 (2012)
ISBN 10: 3848403390 ISBN 13: 9783848403394
New Taschenbuch Quantity Available: 1
Seller:
BuchWeltWeit Inh. Ludwig Meier e.K.
(Bergisch Gladbach, Germany)
Rating
[?]

Book Description LAP Lambert Academic Publishing Feb 2012, 2012. Taschenbuch. Condition: Neu. Neuware - This book deals with the theoretical and the computational aspects of the classical Tower of Hanoi Problem (THP) and its multi-peg generalization. Chapter 1 reviews the classical THP in its general form with n( 1) discs and 3 pegs, with the algorithms, both recursive and iterative. Chapter 2 considers the multi-peg generalization with n discs and p pegs, and gives some local-value relationships satisfied by M(n,p), kmin(n,p) and kmax(n,p), where M(n,p) is the presumed minimum number of moves, and kmin(n,p) and kmax(n,p) are the optimal partition numbers, and presents a recursive algorithm Chapter 3 gives the closed-form expressions for M(n,4), kmin(n,4) and kmax(n,4), and gives an iterative algorithm based on the divide-and-conquer approach. It is shown that, for n 6, the presumed minimum solution is the optimal solution. Chapter 4 extends the results of Chapter 3 to find the explicit forms of M(n,p), kmin(n,p) and kmax(n,p), and establishes the equivalence of four formulations of the multi-peg THP. The divide-and-conquer approach has also been extended. 156 pp. Englisch. Seller Inventory # 9783848403394

More information about this seller | Contact this seller

Buy New
US$ 69.88
Convert currency

Add to Basket

Shipping: US$ 19.70
From Germany to U.S.A.
Destination, rates & speeds

3.

A. A. K. Majumdar
Published by LAP Lambert Academic Publishing Feb 2012 (2012)
ISBN 10: 3848403390 ISBN 13: 9783848403394
New Taschenbuch Quantity Available: 1
Seller:
Rheinberg-Buch
(Bergisch Gladbach, Germany)
Rating
[?]

Book Description LAP Lambert Academic Publishing Feb 2012, 2012. Taschenbuch. Condition: Neu. Neuware - This book deals with the theoretical and the computational aspects of the classical Tower of Hanoi Problem (THP) and its multi-peg generalization. Chapter 1 reviews the classical THP in its general form with n( 1) discs and 3 pegs, with the algorithms, both recursive and iterative. Chapter 2 considers the multi-peg generalization with n discs and p pegs, and gives some local-value relationships satisfied by M(n,p), kmin(n,p) and kmax(n,p), where M(n,p) is the presumed minimum number of moves, and kmin(n,p) and kmax(n,p) are the optimal partition numbers, and presents a recursive algorithm Chapter 3 gives the closed-form expressions for M(n,4), kmin(n,4) and kmax(n,4), and gives an iterative algorithm based on the divide-and-conquer approach. It is shown that, for n 6, the presumed minimum solution is the optimal solution. Chapter 4 extends the results of Chapter 3 to find the explicit forms of M(n,p), kmin(n,p) and kmax(n,p), and establishes the equivalence of four formulations of the multi-peg THP. The divide-and-conquer approach has also been extended. 156 pp. Englisch. Seller Inventory # 9783848403394

More information about this seller | Contact this seller

Buy New
US$ 69.88
Convert currency

Add to Basket

Shipping: US$ 19.70
From Germany to U.S.A.
Destination, rates & speeds

4.

A. A. K. Majumdar
Published by LAP Lambert Academic Publishing Feb 2012 (2012)
ISBN 10: 3848403390 ISBN 13: 9783848403394
New Taschenbuch Quantity Available: 1
Print on Demand
Seller:
AHA-BUCH GmbH
(Einbeck, Germany)
Rating
[?]

Book Description LAP Lambert Academic Publishing Feb 2012, 2012. Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Neuware - This book deals with the theoretical and the computational aspects of the classical Tower of Hanoi Problem (THP) and its multi-peg generalization. Chapter 1 reviews the classical THP in its general form with n( 1) discs and 3 pegs, with the algorithms, both recursive and iterative. Chapter 2 considers the multi-peg generalization with n discs and p pegs, and gives some local-value relationships satisfied by M(n,p), kmin(n,p) and kmax(n,p), where M(n,p) is the presumed minimum number of moves, and kmin(n,p) and kmax(n,p) are the optimal partition numbers, and presents a recursive algorithm Chapter 3 gives the closed-form expressions for M(n,4), kmin(n,4) and kmax(n,4), and gives an iterative algorithm based on the divide-and-conquer approach. It is shown that, for n 6, the presumed minimum solution is the optimal solution. Chapter 4 extends the results of Chapter 3 to find the explicit forms of M(n,p), kmin(n,p) and kmax(n,p), and establishes the equivalence of four formulations of the multi-peg THP. The divide-and-conquer approach has also been extended. 156 pp. Englisch. Seller Inventory # 9783848403394

More information about this seller | Contact this seller

Buy New
US$ 69.88
Convert currency

Add to Basket

Shipping: US$ 33.92
From Germany to U.S.A.
Destination, rates & speeds

5.

A a K Majumdar
Published by LAP Lambert Academic Publishing, Germany (2012)
ISBN 10: 3848403390 ISBN 13: 9783848403394
New Paperback Quantity Available: 1
Seller:
The Book Depository EURO
(London, United Kingdom)
Rating
[?]

Book Description LAP Lambert Academic Publishing, Germany, 2012. Paperback. Condition: New. Aufl.. Language: English . Brand New Book. This book deals with the theoretical and the computational aspects of the classical Tower of Hanoi Problem (THP) and its multi-peg generalization. Chapter 1 reviews the classical THP in its general form with n( 1) discs and 3 pegs, with the algorithms, both recursive and iterative. Chapter 2 considers the multi-peg generalization with n discs and p pegs, and gives some local-value relationships satisfied by M(n, p), kmin(n, p) and kmax(n, p), where M(n, p) is the presumed minimum number of moves, and kmin(n, p) and kmax(n, p) are the optimal partition numbers, and presents a recursive algorithm Chapter 3 gives the closed-form expressions for M(n,4), kmin(n,4) and kmax(n,4), and gives an iterative algorithm based on the divide-and-conquer approach. It is shown that, for n 6, the presumed minimum solution is the optimal solution. Chapter 4 extends the results of Chapter 3 to find the explicit forms of M(n, p), kmin(n, p) and kmax(n, p), and establishes the equivalence of four formulations of the multi-peg THP. The divide-and-conquer approach has also been extended. Seller Inventory # KNV9783848403394

More information about this seller | Contact this seller

Buy New
US$ 104.83
Convert currency

Add to Basket

Shipping: US$ 3.92
From United Kingdom to U.S.A.
Destination, rates & speeds

6.

A.A.K. Majumdar
Published by LAP LAMBERT Academic Publishing (2012)
ISBN 10: 3848403390 ISBN 13: 9783848403394
New Softcover Quantity Available: 1
Seller:
Irish Booksellers
(Portland, ME, U.S.A.)
Rating
[?]

Book Description LAP LAMBERT Academic Publishing, 2012. Condition: New. book. Seller Inventory # M3848403390

More information about this seller | Contact this seller

Buy New
US$ 124.41
Convert currency

Add to Basket

Shipping: US$ 3.27
Within U.S.A.
Destination, rates & speeds

7.

A.A.K. Majumdar
Published by LAP LAMBERT Academic Publishing (2012)
ISBN 10: 3848403390 ISBN 13: 9783848403394
New Paperback Quantity Available: 1
Seller:
Books Express
(Portsmouth, NH, U.S.A.)
Rating
[?]

Book Description LAP LAMBERT Academic Publishing, 2012. Paperback. Condition: New. Ships with Tracking Number! INTERNATIONAL WORLDWIDE Shipping available. Buy with confidence, excellent customer service!. Seller Inventory # 3848403390n

More information about this seller | Contact this seller

Buy New
US$ 261.78
Convert currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, rates & speeds