yyz/bk_bishe_pi
1
0
Fork 0
mirror of https://gitee.com/yyz_o/bk_bishe_pi.git synced 2025-09-07 23:21:26 +00:00
Code Issues Packages Projects Releases Wiki Activity

2025.5.28第一次提交，仿真平台修复bug同步修复

Browse Source
This commit is contained in:
氧原子
2025-05-28 21:51:08 +08:00
parent 9d96af2ff3
commit 14b3d14170
6 changed files with 68 additions and 27 deletions
Download Patch File Download Diff File Expand all files Collapse all files

59
bot_code_turn/maze_func_explore.cpp
View File

@@ -22,9 +22,32 @@ bool check_mark()
bool S_mark;
bool E_mark;
if (y < size_y - 1)
{
if (!wall[x][y+1][0])
{
N_mark = mark[x][y+1];
}
else
{
N_mark = true;
}
}
else
{
N_mark = true;
}
if (x > 0)
{
W_mark = mark[x-1][y];
if (!wall[x][y][1])
{
W_mark = mark[x-1][y];
}
else
{
W_mark = true;
}
}
else
{
@@ -33,7 +56,14 @@ bool check_mark()
if (y > 0)
{
S_mark = mark[x][y-1];
if (!wall[x][y][0])
{
S_mark = mark[x][y-1];
}
else
{
S_mark = true;
}
}
else
{
@@ -42,28 +72,21 @@ bool check_mark()
if (x < size_x - 1)
{
E_mark = mark[x+1][y];
if (!wall[x+1][y][1])
{
E_mark = mark[x+1][y];
}
else
{
E_mark = true;
}
}
else
{
E_mark = true;
}
if (y < size_y - 1)
{
N_mark = mark[x][y+1];
}
else
{
N_mark = true;
}
bool N_road = (!wall[x][y+1][0] && N_mark);
bool W_road = (!wall[x][y][1] && W_mark);
bool S_road = (!wall[x][y][0] && S_mark);
bool E_road = (!wall[x+1][y][1] && E_mark);
if (N_road && W_road && S_road && E_road)
if (N_mark && W_mark && S_mark && E_mark)
{
check = true;
}