在一个简单的高峰时间求解器中使用BFS——为什么我的代码不能求解棋盘
Using BFS in a simple Rush Hour solver - why is my code not solving the board?
UPDATE-下面的一个replier解决了主要问题(我有一个'='，而我本应该有一个'%='')，但现在我得到了错误的输出。我想我会按照建议提供一些输入/输出示例，这样也许有人可以发现我哪里出了问题。
假设我输入：
......
......
xx....
......
......
......
这应该产生输出：
4
x r
x r
x r
x r
表示x在4次移动中到达了第三排最右边的位置，并且x每次移动都必须向右移动。
相反，我得到了输出：
3
x r
x l
x r
在下面的代码中，程序接受一个6x6的字符块来表示游戏板。(句号是空格，字符代表汽车。)棋盘课上所做的工作和主要功能都是正确的，我已经和教授核实过了。然而，我正在努力纠正我的输出。我知道我在求解函数中使用的逻辑不是最好的方法，但我必须尝试让它发挥作用，这样我就可以在不复制教授的解的情况下得到分数。
#include <iostream>
#include <string>
#include <queue>
#include <set>
#include <list>
using namespace std;
class board
{
public:
board() {count = 0;}
bool isSolved()
{
return currState[17] = 'x';
}
string currState;
string moveList;
int count;
};
bool operator < (const board& board1, const board& board2)
{
return board1.currState < board2.currState;
}
void solve (const board& curr, int i, list<board>& toTest, const set<board>& testedSet, bool vert)
{
board newMove(curr);
if (vert == false)
{
if (i % 6 == 0 && curr.currState[i] != '.')
{
if (curr.currState[i] == curr.currState[i+1] && curr.currState[i+2] == '.')
{
newMove.moveList = newMove.moveList + newMove.currState[i] + " " + "r" + "n";
newMove.currState[i+2] = newMove.currState[i];
newMove.currState[i] = '.';
newMove.count++;
}
if (curr.currState[i] == curr.currState[i+1] && curr.currState[i] == curr.currState[i+2] && curr.currState[i+3] == '.')
{
newMove.moveList = newMove.moveList + newMove.currState[i] + " " + "r" + "n";
newMove.currState[i+3] = newMove.currState[i];
newMove.currState[i] = '.';
newMove.count++;
}
}
else if ((i + 1) % 6 == 0 && curr.currState[i] != '.')
{
if (curr.currState[i] == curr.currState[i-1] && curr.currState[i-2] == '.')
{
newMove.moveList = newMove.moveList + newMove.currState[i] + " " + "l" + "n";
newMove.currState[i-2] = newMove.currState[i];
newMove.currState[i] = '.';
newMove.count++;
}
if (curr.currState[i] == curr.currState[i-1] && curr.currState[i] == curr.currState[i-2] && curr.currState[i-3] == '.')
{
newMove.moveList = newMove.moveList + newMove.currState[i] + " " + "l" + "n";
newMove.currState[i-3] = newMove.currState[i];
newMove.currState[i] = '.';
newMove.count++;
}
}
else
{
if (i % 2 != 0 && i % 3 != 0 && curr.currState[i] != '.')
{
if (curr.currState[i] == curr.currState[i+1] && curr.currState[i-1] == '.' && curr.currState[i+2] != curr.currState[i])
{
newMove.moveList = newMove.moveList + newMove.currState[i] + " " + "l" + "n";
newMove.currState[i-1] = newMove.currState[i];
newMove.currState[i+1] = '.';
newMove.count++;
}
if (curr.currState[i] == curr.currState[i+1] && curr.currState[i+2] == '.' && curr.currState[i-1] != curr.currState[i])
{
newMove.moveList = newMove.moveList + newMove.currState[i] + " " + "r" + "n";
newMove.currState[i+2] = newMove.currState[i];
newMove.currState[i] = '.';
newMove.count++;
}
if (curr.currState[i] == curr.currState[i+1] && curr.currState[i] == curr.currState[i+2] && curr.currState[i-1] == '.' && curr.currState[i+3] != curr.currState[i])
{
newMove.moveList = newMove.moveList + newMove.currState[i] + " " + "l" + "n";
newMove.currState[i-1] = newMove.currState[i];
newMove.currState[i+2] = '.';
newMove.count++;
}
if (curr.currState[i] == curr.currState[i+1] && curr.currState[i] == curr.currState[i+2] && curr.currState[i+3] == '.' && curr.currState[i-1] != curr.currState[i])
{
newMove.moveList = newMove.moveList + newMove.currState[i] + " " + "r" + "n";
newMove.currState[i+3] = newMove.currState[i];
newMove.currState[i] = '.';
newMove.count++;
}
}
if (i % 2 == 0 && (i + 2) % 6 != 0 && curr.currState[i] != '.')
{
if (curr.currState[i] == curr.currState[i+1] && curr.currState[i-1] == '.' && curr.currState[i+2] != curr.currState[i])
{
newMove.moveList = newMove.moveList + newMove.currState[i] + " " + "l" + "n";
newMove.currState[i-1] = newMove.currState[i];
newMove.currState[i+1] = '.';
newMove.count++;
}
if (curr.currState[i] == curr.currState[i+1] && curr.currState[i+2] == '.' && curr.currState[i-1] != curr.currState[i])
{
newMove.moveList = newMove.moveList + newMove.currState[i] + " " + "r" + "n";
newMove.currState[i+2] = newMove.currState[i];
newMove.currState[i] = '.';
newMove.count++;
}
if (curr.currState[i] == curr.currState[i+1] && curr.currState[i] == curr.currState[i+2] && curr.currState[i+3] == '.' && curr.currState[i-1] != curr.currState[i])
{
newMove.moveList = newMove.moveList + newMove.currState[i] + " " + "r" + "n";
newMove.currState[i+3] = newMove.currState[i];
newMove.currState[i] = '.';
newMove.count++;
}
}
if (i % 3 == 0 && curr.currState[i] != '.')
{
if (curr.currState[i] == curr.currState[i+1] && curr.currState[i-1] == '.' && curr.currState[i+2] != curr.currState[i])
{
newMove.moveList = newMove.moveList + newMove.currState[i] + " " + "l" + "n";
newMove.currState[i-1] = newMove.currState[i];
newMove.currState[i+1] = '.';
newMove.count++;
}
if (curr.currState[i] == curr.currState[i+1] && curr.currState[i+2] == '.' && curr.currState[i-1] != curr.currState[i])
{
newMove.moveList = newMove.moveList + newMove.currState[i] + " " + "r" + "n";
newMove.currState[i+2] = newMove.currState[i];
newMove.currState[i] = '.';
newMove.count++;
}
}
}
}
if (vert == true)
{
if (i < 17)
{
if (curr.currState[i] == curr.currState[i+6] && curr.currState[i] == curr.currState[i+12] && curr.currState[i+18] == '.')
{
newMove.moveList = newMove.moveList + newMove.currState[i] + " " + "d" + "n";
newMove.currState[i+18] = newMove.currState[i];
newMove.currState[i] = '.';
newMove.count++;
}
if (curr.currState[i] == curr.currState[i+6] && curr.currState[i+12] == '.')
{
if (i < 6 || curr.currState[i] != curr.currState[i-6])
{
newMove.moveList = newMove.moveList + newMove.currState[i] + " " + "d" + "n";
newMove.currState[i+12] = newMove.currState[i];
newMove.currState[i] = '.';
newMove.count++;
}
}
}
if (i > 17)
{
if (curr.currState[i] == curr.currState[i-6] && curr.currState[i] == curr.currState[i-12] && curr.currState[i-18] == '.')
{
newMove.moveList = newMove.moveList + newMove.currState[i] + " " + "u" + "n";
newMove.currState[i-18] = newMove.currState[i];
newMove.currState[i] = '.';
newMove.count++;
}
if (curr.currState[i] == curr.currState[i-6] && curr.currState[i-12] == '.')
{
if (i > 29 || curr.currState[i] != curr.currState[i+6])
{
newMove.moveList = newMove.moveList + newMove.currState[i] + " " + "u" + "n";
newMove.currState[i-12] = newMove.currState[i];
newMove.currState[i] = '.';
newMove.count++;
}
}
}
}
if (testedSet.find(newMove) == testedSet.end())
toTest.push_back(newMove);
}
int main()
{
list<board> toBeTested;
string input;
board current;
set<board> tested;
bool vertical = false;
for (int i = 0; i < 6; i++)
{
getline(cin, input);
current.currState += input;
}
toBeTested.push_back(current);
while (toBeTested.size() > 0 && current.isSolved() == false)
{
current = toBeTested.front();
toBeTested.pop_front();
if (current.isSolved() == false && tested.find(current) == tested.end())
{
tested.insert(current);
for (int i = 0; i < 36; i++)
{
solve(current, i, toBeTested, tested, vertical);
vertical = true;
solve(current, i, toBeTested, tested, vertical);
vertical = false;
}
}
}
if (current.isSolved() == false)
cout << current.count << endl << current.moveList;
else
cout << -1 << endl;
return 0;
}
很难弄清楚您在这里要做什么，因为许多值都是硬编码的，并且程序中没有使用太多抽象。
我猜你是想做这样的事http://www.theiling.de/projects/rushhour.html其中输入是类似板的：
aaobcc..哦。。xxo。。。deeffpd.k.phh.k.p
如果您根据我的评论对board::isSolved()进行了更正：
bool isSolved()
{
return currState[17] == 'x';
}
你至少会得到-1:以外的东西
10b dc lh rp up up uf rk uh lh r
但是，这不是输入问题的解决方案。
看起来你没有正确地计算下一个状态。在车辆移动后，应该有一个循环来迭代车辆的每一部分。
一定要尝试抽象更多的细节。例如，也许您可以向board添加方法，用于(1)计算有效移动的列表，以及(2)应用单个移动，返回新的board。此外，如果您还没有学会如何使用gdb之类的调试器，那么现在正是开始学习的好时机。请参阅如何使用MinGW gdb调试器在Windows中调试C++程序？
相关文章：
- 为什么"do while"循环不断退出，即使条件计算结果为 false？
- 为什么在全局范围内使用"extern int a"似乎不行？
- 为什么在popback(）操作之后，它仍然打印完整的矢量
- 为什么随机数生成器不在void函数中随机化数字，而在main函数中随机化
- 为什么两个不同的未命名名称空间可以共存于一个cpp文件中
- 为什么会发生堆损坏
- 为什么使用 "this" 指针调用派生成员函数？
- C++我的数学有什么问题，为什么我的代码不能正确循环
- 如果我只是不访问queue_front节点的子节点，而是将它们推到队列中呢?还是BFS吗
- 为什么比较运算符如此快速
- 为什么 Serial.println(<char[]>);返回随机字符？
- 为什么这个运算符<重载函数对 STL 算法不可见？
- 为什么不;名字在地图上是按顺序排列的吗
- 我的字符计数代码计算错误.为什么
- 为什么在没有显式默认构造函数的情况下，将另一个结构封装在联合中作为成员的结构不能编译
- 为什么我的C#代码在调用回C++COM直到Task时会暂停.等待/线程.加入
- 为什么在C++中使用私有复制构造函数与删除复制构造函数
- 为什么BFS C 中的运行时错误
- 为什么BFS算法并不总是能找到魔方的解？
- 在一个简单的高峰时间求解器中使用BFS——为什么我的代码不能求解棋盘
