Skip Navigation

The Computer Journal 1994 37(5):463-464; doi:10.1093/comjnl/37.5.463
© 1994 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Majumdar, A. A. K.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A Note on the Iterative Algorithm for the Reve's Puzzle

A. A. K. Majumdar *

Department of Mathematics, Bangladesh University of Engineering and Technology (BUET), Dhaka 1000, Bangladesh

An iterative algorithm based on the divide-and-conquer approach has been presented by van de Liefvoort for the Reve's puzzle. This note justifies the method suggested by Liefvoort to determine the number of sizes of the optimal slices, each of which can be moved in some iterative algorithm of the three-peg problem.

Received October 1993. revised February 1994.

* Department of Mathematics, Bangladesh University of Engineering and Technology (BUET), Dhaka 1000, Bangladesh


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.