C++ pagalbos!

Viską programavau... Kažkaip dėl rezultato. Nes turėtų būti tikslu gaut 000. Gal žinote apie Missionaries and Cannibals (Depth-First Search).

Todėl čia programavau, bet kažkaip... Lauksiu jūsų patarimo.

#include <string>
#include <utility> 
#include <vector> 
#include <iostream>

using namespace std;



vector< pair< int, pair < int, int > > > newStatesSet(pair< int, pair < int, int > > state) {

vector< pair< int, pair < int, int > > > newStatesSet;
int C = state.second.first, M = state.second.second;

if (state.first == 0) {
	if (C >= 1)
		newStatesSet.push_back(make_pair(1, make_pair(C - 1, M)));
	if (M >= 1)
		newStatesSet.push_back(make_pair(1, make_pair(C, M - 1)));
	else if (C >= 2)
		newStatesSet.push_back(make_pair(1, make_pair(C - 2, M)));
	if (C >= 1 && M >= 1)
		newStatesSet.push_back(make_pair(1, make_pair(C - 1, M - 1)));
	else if (M >= 2)
		newStatesSet.push_back(make_pair(1, make_pair(C, M - 2)));
}
else {
	C = 3 - C;
	M = 3 - M;

	if (C >= 1)
		newStatesSet.push_back(make_pair(0, make_pair(3 - C + 1, 3 - M)));
	if (M >= 1)
		newStatesSet.push_back(make_pair(0, make_pair(3 - C, 3 - M + 1)));
	else if (C >= 2)
		newStatesSet.push_back(make_pair(0, make_pair(3 - C + 2, 3 - M)));
	if (C >= 1 && M >= 1)
		newStatesSet.push_back(make_pair(0, make_pair(3 - C + 1, 3 - M + 1)));
	else if (M >= 2)
		newStatesSet.push_back(make_pair(0, make_pair(3 - C, 3 - M + 2)));
}
return newStatesSet;
}

bool validState(pair<int, pair<int, int> > state) {
int C = state.second.first, M = state.second.second;
if (C > M && M != 0)
	return false;
C = 3 - C, M = 3 - M;
if (C > M && M != 0)
	return false;
return true;
}


bool  depthLimitedSearch(pair<int, pair<int, int> > source, pair<int, pair<int, int> > goal, int depth, vector< pair< int, pair < int, int > > > &ans) {

if (source == goal)
	return true;

if (depth <= 0)
	return false;

vector< pair< int, pair < int, int > > > leafs = newStatesSet(source);
for (auto &leaf : leafs)
	if (validState(leaf)) {
		if (depthLimitedSearch(leaf, goal, depth - 1, ans)) {
			ans.push_back(leaf);
			return true;
		}
	}
}

string form(int stateNos, string character) {
string rep = "";
for (int i = 1; i <= 3; i++)
	if (stateNos >= i)
		rep.append(character);
	else
		rep.append(" ");
return rep;
}

void displayState(pair<int, pair<int, int> > state) {
string rep = "";
rep.append(form(state.second.first, "C"));
rep.append(form(state.second.second, "M"));
for (int i = 1; i <= 6; i++) {
	if (state.first == 0 && i == 2)
		rep.append("B");
	else
		if (state.first == 1 && i == 5)
			rep.append("B");
		else
			rep.append(" ");
}
rep.append(form(3 - state.second.first, "C"));
rep.append(form(3 - state.second.second, "M"));
cout << rep << endl;
}

void iterativeDeepeningSearch(pair<int, pair<int, int> > source, pair<int, pair<int, int> > goal) {

vector< pair<int, pair<int, int> > > ans;
for (int i = 1; i <= 25; i++) {
	vector<pair<int, pair<int, int> > >vec;
	depthLimitedSearch(source, goal, i, vec);
	if (vec.size()>0) {
		ans = vec;
		break;
	}
}
cout << "";
displayState(source);
for (auto it = ans.rbegin(); it != ans.rend(); ++it)
	displayState(*it);
}

int main()
{
pair<int, pair<int, int> > source = make_pair(0, make_pair(3, 3));
pair<int, pair<int, int> > goal = make_pair(1, make_pair(0, 0));
iterativeDeepeningSearch(source, goal);
system("pause");
return 0;
}