/************************************************************************\
|* gtf is a framework for analyzing two-player zero-sum games           *|
|* Copyright (C) 2005 Troels Bjerre Sorensen                            *|
|*                                                                      *|
|* This program is free software; you can redistribute it and/or modify *|
|* it under the terms of the GNU General Public License as published by *|
|* the Free Software Foundation; either version 2 of the License, or    *|
|* (at your option) any later version.                                  *|
|*                                                                      *|
|* This program is distributed in the hope that it will be useful, but  *|
|* WITHOUT ANY WARRANTY; without even the implied warranty of           *|
|* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU    *|
|* General Public License for more details.                             *|
|*                                                                      *|
|* You should have received a copy of the GNU General Public License    *|
|* along with this program; if not, write to the                        *|
|* Free Software Foundation, Inc., 59 Temple Place - Suite 330,         *|
|* Boston, MA 02111-1307, USA.                                          *|
\************************************************************************/

package gtf.game;

import gtf.Visitor;
import gtf.util.Rational;

public abstract class GameTree {
	String p1learn = ":", p2learn = ":";
	Rational probmult = Rational.ONE;
	
	public final String getP1Learn() { return p1learn; }
	public final String getP2Learn() { return p2learn; }

	public final String getPlayerLearn() {
		return "(" + p1learn + "," + p2learn + ")";
	}
	
	public final String getPlayerLearn(int player) { 
		return player == 1 ? p1learn : p2learn;
	}
	
	public final Rational getProbMult() {
		return probmult;
	}

	public abstract void visitBy(Visitor v);
}