SI

/* ------------------------------------------ */
		/* Algoritmos recursivos (implementan Search) */
		/* ------------------------------------------ */

		//eightPuzzleDepthLimitedSearchDemo(10);	 					// Busqueda en profundidad limitada
		//eightPuzzleIterativeDeepeningSearchDemo(); 					// Busqueda en profundidad iterativa


		/* -------------------- */
		/* BUSQUEDA INTELIGENTE */
		/* -------------------- */

		/* A* con busqueda en arboles */ //(mas complicada pero aun asi con h2 mas q en anchura)
		//eightPuzzleAStarDemo(new AStarSearch(new TreeSearch(),new NullHeuristicFunction()));
		//eightPuzzleAStarDemo(new AStarSearch(new TreeSearch(),new MisplacedT HeuristicFunction(goalState)));
		eightPuzzleAStarDemo(new AStarSearch(new TreeSearch(),new ManhattanHeuristicFunction(goalState)));
		//eightPuzzleAStarDemo(new AStarSearch(new TreeSearch(),new NoConsistentHeuristicFunction(goalState)));

		//no va a llegar en muchos a solucion optima (mirar las instancias raras)
		/* A* con busqueda en grafos, sin rectificar ni reexpandir nodos ya expandidos */
		//eightPuzzleAStarDemo(new AStarSearch(new GraphSearch(),new NullHeuristicFunction()));
		//eightPuzzleAStarDemo(new AStarSearch(new GraphSearch(),new MisplacedTilleHeuristicFunction(goalState)));
		eightPuzzleAStarDemo(new AStarSearch(new GraphSearch(),new Heuristic12(goalState)));
		//eightPuzzleAStarDemo(new AStarSearch(new GraphSearch(),new ManhattanHeuristicFunction(goalState)));
		//eightPuzzleAStarDemo(new AStarSearch(new GraphSearch(),new NoConsistentHeuristicFunction(goalState)));


		//estos  hasta el lunes nooooooooooooooooooooooo

		/* A* con busqueda en grafos, con reexpansion de nodos ya expandidos */ //rectifica los nodos de abierta
		//eightPuzzleAStarDemo(new AStarSearch(new GraphSearchReinsertExpanded(),new NullHeuristicFunction()));
		//eightPuzzleAStarDemo(new AStarSearch(new GraphSearchReinsertExpanded(),new MisplacedTilleHeuristicFunction(goalState)));
		//eightPuzzleAStarDemo(new AStarSearch(new GraphSearchReinsertExpanded(),new ManhattanHeuristicFunction(goalState)));
		//eightPuzzleAStarDemo(new AStarSearch(new GraphSearchReinsertExpanded(),new NoConsistentHeuristicFunction(goalState)));

		/* A* con busqueda en grafos, con rectificacion de nodos ya expandidos */ //algo general de busqueda, rectifica cascada
		//eightPuzzleAStarDemo(new AStarSearch(new GraphSearchRectifyExpanded(),new NullHeuristicFunction()));
		//eightPuzzleAStarDemo(new AStarSearch(new GraphSearchRectifyExpanded(),new MisplacedTilleHeuristicFunction(goalState)));
		//eightPuzzleAStarDemo(new AStarSearch(new GraphSearchRectifyExpanded(),new ManhattanHeuristicFunction(goalState)));
		//eightPuzzleAStarDemo(new AStarSearch(new GraphSearchRectifyExpanded(),new NoConsistentHeuristicFunction(goalState)));

		/* A* con monitorizacion de los f-valores de los nodos expandidos */
		//eightPuzzleAStarDemo(new AStarSearch(new GraphSearchRectifyExpanded(new NullHeuristicFunction()),new NullHeuristicFunction()));
		//eightPuzzleAStarDemo(new AStarSearch(new GraphSearchRectifyExpanded(new MisplacedTilleHeuristicFunction(goalState)),new MisplacedTilleHeuristicFunction(goalState)));
		//eightPuzzleAStarDemo(new AStarSearch(new GraphSearchRectifyExpanded(new ManhattanHeuristicFunction(goalState)),new ManhattanHeuristicFunction(goalState)));
		//eightPuzzleAStarDemo(new AStarSearch(new GraphSearchRectifyExpanded(new NoConsistentHeuristicFunction(goalState)),new NoConsistentHeuristicFunction(goalState)));

		/* Greedy Best First Search */
		//eightPuzzleGreedyBestFirstDemo(new MisplacedTilleHeuristicFunction(goalState));
		//eightPuzzleGreedyBestFirstDemo(new ManhattanHeuristicFunction(goalState));

		/* Algoritmo de Ponderacion Estatica, PEA*/
		//eightPuzzleAStarDemo(new AStarSearch(new GraphSearchReinsertExpanded(),new ManhattanHeuristicFunction(goalState, 0.2)));