public boolean isHighest (Move m)
	{
		int index = -1;
		switch(m)
		{
		case North: index = 0; break;
		case South: index = 1; break;
		case West : index = 2; break;
		case East : index = 3; break;
		}

		for(int i = 0; i < 4; i++)
		{
			if(i != index && rewards[i] >= rewards[index])
				return false;
		}
		return true;
	}