【vjudge】八数码问题

最新推荐文章于 2019-08-06 15:54:07 发布

原创

最新推荐文章于 2019-08-06 15:54:07 发布 · 904 阅读

1 ·

CC 4.0 BY-SA版权

该博客介绍了如何解决八数码问题，这是一个经典的搜索问题，适合使用广度优先搜索。博主通过栈来存储状态，并利用一维数组进行重复状态检测。文章提供了示例输入和输出，并给出了程序已通过所有测试的情况。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Eight

The 15-puzzle has been around for over 100 years; even if you don’t know it by 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 4 frame with one tile missing. Let’s call the missing tile ‘x’; the object of the puzzle is to arrange the tiles so that they are ordered as:

1 2 3 4

5 6 7 8

9 10 11 12

13 14 15 x

where the only legal operation is to exchange ‘x’ with one of the tiles with which it shares an edge. As an example, the following sequence of moves solves 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