BibTex Citation Data :
@article{JFMA10106, author = {Marco Ripà}, title = {REDUCING THE CLOCKWISE-ALGORITHM TO k LENGTH CLASSES}, journal = {Journal of Fundamental Mathematics and Applications (JFMA)}, volume = {4}, number = {1}, year = {2021}, keywords = {Nine dots puzzle; Clockwise-algorithm; Thinking outside the box; Polygonal path; Optimization problem; Link length}, abstract = {In the present paper, we consider an optimization problem related to the extension in k -dimensions of the well known 3x3 points problem by Sam Loyd. In particular, thanks to a variation of the so called “clockwise-algorithm”, we show how it is possible to visit all the 3^k points of the k -dimensional grid given by the Cartesian product of (0, 1, 2) using covering trails formed by h( k )=(3^ k -1)/2 links who belong to k (Euclidean) length classes. We can do this under the additional constraint of allowing only turning points which belong to the set B ( k ):= \{ (0, 3) x (0, 3) x ... x (0, 3) \} .}, issn = {2621-6035}, pages = {61--68} doi = {10.14710/jfma.v4i1.10106}, url = {https://ejournal2.undip.ac.id/index.php/jfma/article/view/10106} }
Refworks Citation Data :
Article Metrics:
Last update:
Authors who publish articles in this journal agree to the following terms:
For more detailed information about the copyright transfer, please refer to this page: COPYRIGHT TRANSFER FORM