Method for Hua Rongdao Based on Breadth-First Search
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Hua Rongdao is a very famous puzzled of China.In this paper,through analysis of Hua Rongdao,an efficient and convenient algorithm was used to express the layout.And then we use a Hash algorithm,which HashCode was found based on cumulative fold,to solve the problems.The experiment shows that this method is a very efficient way in finding the answer.

    Reference
    Related
    Cited by
Get Citation

李彦辉,李爱军.一种改进的广度优先求解华容道问题的方法.计算机系统应用,2010,19(11):222-225

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:March 05,2010
  • Revised:April 01,2010
  • Adopted:
  • Online:
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063