void breadthFirstSearchWithSweep2(GameState startingGS)
{
//ofstream outFile("BFS.txt");
//outFile.close();
GameState currentState = startingGS;
currentState.sweep2();
int numOfExploredStates = 0;
int wrongTime = 0;
gameStateQueue exploredState;
exploredState.push(currentState);
GameState tempState;
numStack tempNumSuccessors;
Coord2D tempCO;
//char ch[6] = "0.txt";
while(1)
{
if(exploredState.getLen() == 1)
break;
currentState = exploredState.pop();
while(currentState.isGoalState())
{
/*cout<<"by BFS with sweep2:\n";
currentState.getCurrentState().print();*/
//ch[0]++;
//currentState.getCurrentState().outputToFile("BFS.txt");
if(exploredState.getLen() == 1)
break;
currentState = exploredState.pop();
}
tempCO = currentState.getCoordOfLeastNumSuccessor();
tempNumSuccessors = currentState.getNumSuccessorsOfPos(tempCO);
for(int i = 1; i < tempNumSuccessors.getLen(); i++)
{
tempState = currentState;
OPERATION tempOP(tempCO, tempNumSuccessors[i]);
tempState.doOPRT(tempOP);
tempState.sweep2();
if(!tempState.isContradiction())
{
numOfExploredStates++;
//tempState.getCurrentState().print();
exploredState.push(tempState);
}
else
wrongTime++;
}
}
/*cout<<"\n num of states explored: "<<numOfExploredStates
<<"\twrong time: "<<wrongTime<<endl<<endl;*/
}
GameState depthFirstSearchWithSweep2(GameState startingGS)
{
GameState currentState = startingGS;
currentState.sweep2();
int numOfExploredStates = 0;
int wrongTime = 0;
gameStateStack exploredState;
exploredState.push(currentState);
GameState tempState;
numStack tempNumSuccessors;
Coord2D tempCO;
while(1)
{
if(exploredState.getLen() == 1)
{
//cout<<"No Solution!\n";
break;
}
currentState = exploredState.pop();
if(currentState.isGoalState())
break;
tempCO = currentState.getCoordOfLeastNumSuccessor();
tempNumSuccessors = currentState.getNumSuccessorsOfPos(tempCO);
for(int i = 1; i < tempNumSuccessors.getLen(); i++)
{
tempState = currentState;
OPERATION tempOP(tempCO, tempNumSuccessors[i]);
tempState.doOPRT(tempOP);
tempState.sweep2();
if(!tempState.isContradiction())
{
numOfExploredStates++;
exploredState.push(tempState);
}
else
wrongTime++;
}
}
/*cout<<" by DFS with sweep2:\n";
currentState.getCurrentState().print();
cout<<"\n num of states explored: "<<numOfExploredStates
<<"\twrong time: "<<wrongTime<<endl<<endl;*/
currentState.getCurrentState().outputToFile("DFS2 with sweep2.txt");
return currentState;
}
