计算机工程2011，Vol.37Issue(20)：219-222,4.DOI:10.3969/j.issn.1000-3428.2011.20.076
基于双向广度优先搜索的魔力方块问题求解
Solution for Magic Square Problem Based on Bidirectional Breadth-first Search
摘要
Abstract
This paper introduces magic square problem, and analyzes 8-puzzle problem comparatively. It comprehensively discusses some issues relevant to solving magic square problem, such as whether there is a solution, minimum steps, state representation, state repetition judging, transition relation between states of magic square problem. It proposes a solution based on bidirectional Breadth-first Search(BFS) and state transition table. Experimental results prove that compared with other algorithms, the algorithm proposed is efficient and stable, which meets the requirements of real-time solving and presentation of magic square problem.关键词
魔力方块问题/状态判重/状态转换表/双向广度优先搜索/八数码问题Key words
magic square problem/ state repetition judging/ state transition table/ bidirectional Breadth-first Search(BFS)/ 8-puzzle problem分类
信息技术与安全科学引用本文复制引用
王桂平,张帅..基于双向广度优先搜索的魔力方块问题求解[J].计算机工程,2011,37(20):219-222,4.基金项目
国家自然科学基金资助项目(50975250) （50975250）
浙江省自然科学基金资助项目(Y1110671) （Y1110671）
