/**
 *
 * Copyright (C) 2003 Uday Bondhugula
 *
 * This code is available under the GNU GPL version 2. See the file LICENSE
 * for terms and conditions.
 *
 */

import java.util.HashSet;

public class Node{
	float f;
	float g;
	float h;
	Node parent;
	Cube cube;	// this is the current state of the cube
	HashSet successors;
	int move;
	int depth;

	Node()	{
		f = -1;
		g = -1;
		move = -1;
		parent = null;
		successors = new HashSet();
		depth = -1;
	}

	public boolean isGoalNode()	{
		return cube.isSolved();
	}
}