杭电 p1043 acm eight 八数码

最新推荐文章于 2020-10-03 15:05:01 发布

chengouxuan

最新推荐文章于 2020-10-03 15:05:01 发布

阅读量2.6k

点赞数

分类专栏： ACM 文章标签： graph path exchange string numbers each

本文链接：https://blog.csdn.net/chengouxuan/article/details/5294243

版权

本文主要探讨杭电ACM比赛中的P1043题目——八数码问题，它涉及到图论、路径搜索和数字交换等算法。题目要求在限定时间内找到解决方案，并提供了特殊判断标准。

摘要由CSDN通过智能技术生成

Eight

Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1852 Accepted Submission(s): 532
Special Judge

Problem Description

The15-puzzle has been around for over 100 years; even if you don't know itby that name, you've seen it. It is constructed with 15 sliding tiles,each with a number from 1 to 15 on it, and all packed into a 4 by 4frame with one tile missing. Let's call the missing tile 'x'; theobject of the puzzle is to arrange the tiles so that they are orderedas:

 1  2  3  4

 5  6  7  8

 9 10 11 12

13 14 15  x

wherethe only legal operation is to exchange 'x' with one of the tiles withwhich it shares an edge. As an example, the following sequence of movessolves a slightly scrambled puzzle:

 1  2  3  4     1  2  3  4     1  2  3  4     1  2  3  4

 5  6  7  8     5  6  7  8     5  6  7  8     5  6  7  8

 9  x 10 12     9 10  x 12     9 10 11 12     9 10 11 12

13 14 11 15    13 14 11 15    13 14  x 15    13 14 15  x

            r->            d->            r->

Theletters in the previous row indicate which neighbor of the 'x' tile isswapped with the 'x' tile at each step; legal values are 'r','l','u'and 'd', for right, left, up, and down, respectively.

Not allpuzzles can be solved; in 1870, a man named Sam Loyd was famous fordistributing an unsolvable version of the puzzle,