A General Algorithm for Finding a Shortest Path between two n-Configurations-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A General Algorithm for Finding a Shortest Path between two n-Configurations

Published:1987-07 Issue:2 Volume:42 Page:137-141
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Er M.C.

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference5 articles.

1. The Towers of Hanoi problem;Buneman;Inform. Process. Lett.,1980

2. A Short Introduction to the Art of Programming;Dijkstra,1971

3. A representation approach to the Tower of Hanoi problem;Er;Comput. J.,1982

4. A note on the Towers of Hanoi problem;Hayes;Comput. J.,1977

5. Adjudicating a Towers of Hanoi contest;Wood;Internat. J. Comput. Math.,1983

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Which Multi-peg Tower of Hanoi Problems Are Exponential?;Graph-Theoretic Concepts in Computer Science;2012

2. A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles;Information Sciences;2009-08

3. The cyclic multi-peg Tower of Hanoi;ACM Transactions on Algorithms;2006-07

4. Four encounters with sierpińriski’s gasket;The Mathematical Intelligencer;1995-12

5. On the towers of hanoi problem with multiple spare pegs;International Journal of Computer Mathematics;1994-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP