利用電腦探討中周古代益智道戲 _r 華容進」之解法
Use Computers to Study the Solutions of
the Chinese Game "H ua Rong Da
w"
Chun - Ling Wei Shun-Shii Lin
Depar恤eotof Iof叮祖ation 阻d Compu祖rE曲曲tl00
National Taiwan Normal Univerøity Taipei, Taiw血， Republic of Chioa
Abstract
In this paper
,
we will design algorithrns 10 derive the solutions for the Chinese game "Hua Rong Daw". In addition, we want to veri勾 and compare these results with the previous literatures. Since many initial configurations of this game need more than 100 steps to reach the final configurations, we could not search the entire game tree with the ''brute force" approach. Previously, there are no comput-er solutions for this hard problem, but there are many manual trials that are found in many documents. In this paper,
we explore some techniques for totally solving this game.ηle results show that some previous results are not the optimal solutions. We also list our optimal solutions in this paper.Keywords: game tree, binary search tr間， brute force approach
