Search - puzzle of number

Search - puzzle of number - List

[Algorithm] puzzles DL : 0: 算法全名为数字拼图问题(八数码)算法，讲述一个自动完成九宫格数字拼图的算法-Algorithm, called the whole issue of the number of puzzles (8 digital) algorithm, on a number of auto-complete puzzle squares algorithm
Date : 2025-12-20 Size : 63kb User : PT
[Algorithm] Mysteryproblem DL : 0: 重排九宫是一个古老的单人智力游戏。据说重排九宫起源于我国古时由三国演义故事“关羽义释曹操”而设计的智力玩具“华容道”，后来流传到欧洲，将人物变成数字。原始的重排九宫问题是这样的：将数字1～8按照任意次序排在3×3的方格阵列中，留下一个空格。与空格相邻的数字，允许从上，下，左，右方向移动到空格中。游戏的最终目标是通过合法移动，将数字 1～8 按行排好序。在一般情况下，n2-1 谜问题是将数字 1～n2-1 按照任意次序排在n×n的方格阵列中，留下一个空格。允许与空格相邻的数字从上，下，左，右 4个方向移动到空格中。游戏的最终目标是通过合法移动，将初始状态变换到目标状态。对于给定的n×n方格阵列中数字1～n2-1 初始排列，编程计算将初始排列通过合法移动变换为目标状态最少移动次数。 ′数据输入：文件的第1行有1个正整数n。以下的n行是 n×n方格阵列的中数字1～n2-1的初始排列，每行有n个数字表示该行方格中的数字， 0表示空格。接着n行是n×n方格阵列的中数字1～n2-1的目标排列，每行有n个数字表示该行方格中的数字， 0表示空格。1<=n<=10 结果输出: 第 1 行是最少移动次数。-Rearrangement Jiu Gong is an ancient single puzzle. Jiu Gong is said to originate from the rearrangement of China in ancient times by the Three Kingdoms story, "Guan Yu Yi Cao release" designed to intellectual toys "Huarong" and later spread to Europe, will figure into a figure. Jiugong original rearrangement problem is this: will the number 1 to 8 in accordance with any order of ranking, the box in the 3 × 3 array, leaving a space. And the number of adjacent spaces, to allow from the top, bottom, left and right direction to move to the space. The ultimate goal of the game through the legal move, the numbers 1 to 8 lined by row sequence. Under normal circumstances, n2-1 mystery issue is the number 1 ~ n2-1 in accordance with any order of rank n × n array of squares, leaving a space. Permitted number of adjacent spaces from the top, bottom, left and right four directions to move to an empty cell. The ultimate goal of the game through the legal move, transform the initial state to target
Date : 2025-12-20 Size : 863kb User : wakaka
[Algorithm] Newton_GDBH.tar DL : 0: 用pyhton简化的Nowton迭代，实现计算x^6=5的所有实根。适用与初学python的同学参考。同时附带GDBH问题在大于等于6时的10000次迭代范围内的正确性验证-calculate the equation : x^6=5, find all the real number x. Using python and Newton Iteration Method.Then the appendix code is about the puzzle of GDBH and the solution situation.
Date : 2025-12-20 Size : 2kb User : 若水三千
[Algorithm] project DL : 0: 拼图游戏的最原始版本，中间的next按钮按第一次的时候是计算返回到出事状态的步骤。之后每按一次，便倒着走回去（最少步数）。-The jigsaw puzzle of the most primitive version of the middle of the next button is to calculate the first return to the accident the steps of the state. After each time you press, then backwards to go back (at least the number of steps).
Date : 2025-12-20 Size : 221kb User : john
[Algorithm] pingtu DL : 0: 最短步数算法，拼图游戏的最原始版本，中间的next按钮按第一次的时候是计算返回到出事状态的步骤。之后每按一次，便倒着走回去（最少步数）。有代码、有注释、有运行结果图。-The algorithm of the shortest number of steps, the most primitive version of the jigsaw puzzle, the first time, the middle of the next button is to calculate the return to the accident the steps of the state. After each time you press, then backwards to go back (at least the number of steps). Code, comments, and operating results in Figure.
Date : 2025-12-20 Size : 1.12mb User : john
[Algorithm] Septangle-puzzle DL : 0: 解决杜登妮七边形难题，在一个七边形中填入1到14的数字（不能重复），使得每边的三数之和等于26.-杜登妮 heptagon problem solving, enter the number 1 to 14 in a heptagonal in (not repeat), so that each side of the three-number equals 26.
Date : 2025-12-20 Size : 171kb User :