public void searchTree(int minimumValueToReach, RotationTree searchTree,
Cube cubeToSolve, SolutionManager solutionManager,
Solution previousSolution, int targetFloorToSortInCube, int depth)
{
if (minimumValueToReach < 2)
{
minimumValueToReach = 2;
}
for (int rotationSequenceIndex = 0; rotationSequenceIndex < searchTree.getSize(); rotationSequenceIndex++)
{
RotationSequence rotationSequence = searchTree.getRotationSequence(rotationSequenceIndex);
if (rotationSequence != null)
{
Cube cubeAfterRotationSequence = getCubeAfterApplyingSequence(new Cube(cubeToSolve), rotationSequence);
addSequenceToSolutionIfHigherValue(minimumValueToReach, solutionManager, previousSolution,
targetFloorToSortInCube, rotationSequence, cubeAfterRotationSequence);
if (targetFloorToSortInCube == 3 && depth == 0)
{
this.searchTree(minimumValueToReach, searchTree, cubeAfterRotationSequence, solutionManager,
new Solution(rotationSequence, cubeAfterRotationSequence, previousSolution), targetFloorToSortInCube, 1);
}
}
}
}
public static RotationTree getRotationTreeFromFile(RubikFileReader p_File)
{
RotationTree myTree = new RotationTree();
RotationSequence l_rotationLinkedList = new RotationSequence();
while (l_rotationLinkedList.readFromFile(p_File))
{
myTree.addRotationLinkedList(l_rotationLinkedList);
}
return(myTree);
}
private void findBetterSolution(Solution p_solution, RotationTree p_tree, SolutionManager p_solutionManager,
int p_floor)
{
Cube l_rubik = new Cube();
Cube l_permutation = p_solution.getPermutation().getCopy();
int l_minimumValue = Cube.getValue(l_permutation, p_floor);
l_rubik = new Cube(l_permutation);
searchTree(l_minimumValue - 4, p_tree, l_rubik, p_solutionManager,
p_solution, p_floor, 0);
}
public Solution solve(Cube p_rubik, RotationTree p_firstTree, RotationTree p_secondTree, RotationTree p_thirdTree)
{
int l_numberOfCubicleInPlace;
Cube l_permutation = new Cube(p_rubik);
SolutionManager l_solutionManager = new SolutionManager();
Solution l_solutionToDev;
RotationSequence l_rotationLinkedList = new RotationSequence();
int l_floor = getTargetFloor(l_permutation);
l_numberOfCubicleInPlace = Cube.getValue(l_permutation, l_floor);
l_solutionManager.addSolution(l_rotationLinkedList, l_permutation, null, l_numberOfCubicleInPlace, l_floor);
while ((l_solutionToDev = l_solutionManager.getBestUndeveloped()) != null &&
l_solutionManager.getBestValue() < 40)
{
int targetFloor = getTargetFloor(l_solutionToDev.getPermutation());
Console.Write("Searching {0}...", Cube.getValue(l_solutionToDev.getPermutation(), targetFloor));
if (l_solutionManager.getBestValue() > Cube.getValue(l_solutionToDev.getPermutation(), targetFloor) + 14)
{
Console.WriteLine("Couldn't Find a Solution");
return(l_solutionManager.getBest());
}
if (targetFloor == 1)
{
findBetterSolution(l_solutionToDev, p_firstTree, l_solutionManager, targetFloor);
}
if (targetFloor == 2)
{
findBetterSolution(l_solutionToDev, p_secondTree, l_solutionManager, targetFloor);
}
if (targetFloor == 3)
{
findBetterSolution(l_solutionToDev, p_thirdTree, l_solutionManager, targetFloor);
}
l_floor = getTargetFloor(l_solutionManager.getBestValue());
Console.Write("Floor={0}, Best yet:{1}\n", l_floor, l_solutionManager.getBestValue());
}
return(l_solutionManager.getBest());
}
