搜索资源列表
mglj
- 数据结构：迷宫路径求解 数据结构：迷宫路径求解-data structure : labyrinth path data structure Solution : Solving the maze path data structure : Solving labyrinth path data structure : maze Solving Path
puzzlemigong
- 这是一个迷宫程序，迷宫大小是根据你定的数组大小来决定的，enjoy it。-This is a procedural maze, the labyrinth is based on the size you the array size to decide, enjoy it.
migong
- 这是一个小时候玩的游戏 走迷宫- This the game which a childhood played walks the labyrinth
migong111
- 汇编写的迷宫- Collects the compilation the labyrinth
迷宫11
- 汇编写的迷宫- Collects the compilation the labyrinth
formula
- Optimization of 2 dimensional Labyrinth (Maze) representation for tiny memory
formula2
- Optimization of 2 dimensional Labyrinth (Maze) representation for tiny memory
formula3
- Optimization of 2 dimensional Labyrinth (Maze) representation for tiny memory
formula4
- Optimization of 2 dimensional Labyrinth (Maze) representation for tiny memory
formula5
- Optimization of 2 dimensional Labyrinth (Maze) representation for tiny memory
20070221
- 灰鸽子源码加密解迷器-Gray pigeon labyrinth source encryption solution
labyrinth
- 实验实现基本思路：若当前位置可通，则纳入当前路径，并继续朝下一个位置探索，即切换下一位置为当前位置，如此重复直至到达出口；若当前位置不可通，则应顺着来向退回到前一通道块，然后朝着除来向之外的其他方向继续探索；若该通道块的四周4个方块均不可通，则应从当前路径上删除该通道块。设以栈记录当前路径，则栈顶中存放的是当前路径上最后一个通道块。由此，纳入路径的操作即为当前位置入栈；从当前路径上删除前一通道块的才操作即为出栈。-The experimental realization of the basic
AAA
- 迷宫非递归走法，利用循环即可。可做参考。-Non-recursive labyrinth walk, you can take advantage of the cycle. Do reference.
labyrinth
- 通过界面自己设置一个迷宫并解出走出迷宫的路线-By their own interface to set up a maze and solve a maze of routes
3pi(1)
- 本设计以MCU为控制核心,使用迷宫算法与机器自主学习的思想核心和电机PID调速为运动核心的一款智能迷宫小车，通过对传感器的加权平均处理进行高精度数据采集，将连续性变量转换成离散随机变量。首先根据左手运算进行迷宫整体搜索，然后进行数组记忆和最优路径运算，第二次进入赛道5秒逃出迷宫。(This design takes the MCU as the control core, uses the maze algorithm and the machine independent learning c