%0 Journal Article
%T Method for Hua Rongdao Based on Breadth-First Search<br>一种改进的广度优先求解华容道问题的方法
%A 李彦辉
%A 李爱军
%J 计算机系统应用
%D 2010
%I 
%X 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.
%K artificial intelligence
%K breadth-first searche
%K Hua Rongdao
%K HashCode<br>人工智能
%K 广度优先搜索
%K 华容道
%K HashCode
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=D4F6864C950C88FFCE5B6C948A639E39&aid=4BC3DFE70A84BFA258C1BF0A53C6CF9E&yid=140ECF96957D60B2&vid=2A8D03AD8076A2E3&iid=708DD6B15D2464E8&sid=8B59EA573021D671&eid=4966445AEEBA9556&journal_id=1003-3254&journal_name=计算机系统应用&referenced_num=0&reference_num=4