/************************************************************************\ |* 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; import gtf.game.*; import gtf.util.*; import java.io.*; import java.util.*; public class StrategyPrintVisitor> extends RealizationVisitor { HashMap infosets = new HashMap(); public void visitImpPlayerNode(ImpPlayerNode node) { infosets.put(node.getPlayer() == 1 ? p1know : p2know, node); super.visitImpPlayerNode(node); } public void print(Strategy strat, ExtensiveForm ef, PrintStream out) { infosets.clear(); ef.visitBy(this); String[] keys = infosets.keySet().toArray(new String[infosets.size()]); Arrays.sort(keys); for (String key : keys) { ImpPlayerNode node = infosets.get(key); T sum = strat.ZERO; int player = node.getPlayer(); for (GameTree child : node) sum = sum.add(strat.probOf(key + child.getPlayerLearn(player))); if (sum.isPositive()) { System.out.println(key); for (GameTree child : node) { System.out.println(child.getPlayerLearn(player) + ":\t" + strat.probOf(key + child.getPlayerLearn(player)).divide(sum).rationalValue()); } System.out.println(); } } } }