z-logo
open-access-imgOpen Access
A Note on the Iterative Algorithm for the Reve's Puzzle
Author(s) -
A. A. K. Majumdar
Publication year - 1994
Publication title -
the computer journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.319
H-Index - 64
eISSN - 1460-2067
pISSN - 0010-4620
DOI - 10.1093/comjnl/37.5.463
Subject(s) - iterative method , divide and conquer algorithms , algorithm , computer science , mathematics
An iterative algorithm based on the divide-and-conquer appraoch has been presented by van de Liefvoort for the Reve's puzzle. This note justifies the method suggested by Liefvoort to determine the number and sizes of the optimal slices, each of which can be moved in some iterative algorithm of the three-peg problem

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom