public boolean search (String s)
	{
		State = 1;
		getinformation();
		TreeNode pos = Pos;
		boolean found = true;
		outer: while (Pos.node().getaction("C").indexOf(s) < 0 || Pos == pos)
		{
			if ( !Pos.haschildren())
			{
				while ( !hasvariation())
				{
					if (Pos.parent() == null)
					{
						found = false;
						break outer;
					}
					else goback();
				}
				tovarright();
			}
			else goforward();
		}
		showinformation();
		copy();
		return found;
	}