Package stage3

Examples of stage3.NameMap

31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
    // we now must create three outcomes corresponding to the player's 3 choices
   
    // Choice 1: Fold
    InfoSetPair ispFold = ispThisNode.addInfoToBoth(
        );
    gtnFold = new TerminalLeafNode(new ContinueItem(ispFold, this));

    // Choice 2: Raise
    ciRaise = new ContinueItem(
        ispThisNode.addInfoToBoth(new InfoToken(infoType, InfoToken.s_raise)),
        this);

    // Choice 3: Check
    ciCall = new ContinueItem(
        ispThisNode.addInfoToBoth(new InfoToken(infoType, InfoToken.s_call)),
        this);
  }
View Full Code Here
31
32
33
34
35
36
37
38
39
40
41
42
    // we now must create two outcomes corresponding to the player's 2 choices
   
    // Choice 1: Fold
    InfoSetPair ispFold = ispThisNode.addInfoToBoth(
        new InfoToken(infoType, InfoToken.s_fold));
    gtnFold = new TerminalLeafNode(new ContinueItem(ispFold, this));

    // Choice 2: Call
    ciCall = new ContinueItem(
        ispThisNode.addInfoToBoth(new InfoToken(infoType, InfoToken.s_call)),
        this);
  }
View Full Code Here
24
25
26
27
28
29
30
31
32
33
34
    Set newIspLeaves = new HashSet();
   
    for(Iterator i = ciSet.iterator(); i.hasNext(); ) {
     
      ContinueItem ciAppend = (ContinueItem) i.next();
      ChanceNode cn = new ChanceNode(ciAppend, numClusters);
      newIspLeaves.addAll(cn.ciNext);
     
    }
   
    return newIspLeaves;
View Full Code Here
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
  public ContinueItem ciCall;
 
  public EndRoundChoiceNode(ContinueItem ciToFill, int infoType) {
    super(ciToFill, new HashSet());
   
    InfoSetPair ispThisNode = ciToFill.ispChild;
   
    // we now must create two outcomes corresponding to the player's 2 choices
   
    // Choice 1: Fold
    InfoSetPair ispFold = ispThisNode.addInfoToBoth(
        new InfoToken(infoType, InfoToken.s_fold));
    gtnFold = new TerminalLeafNode(new ContinueItem(ispFold, this));

    // Choice 2: Call
    ciCall = new ContinueItem(
View Full Code Here
40
41
42
43
44
45
46
47
48
49
50
            [DoGT.s_bc0][DoGT.s_player1], i);
       
        InfoToken iP2 = new InfoToken(InfoToken.s_holeCardsCluster
            [DoGT.s_bc0][DoGT.s_player2], j);
       
        InfoSetPair ispNew = isp.addInfoToOnePlayer(iP1, DoGT.s_player1)
            .addInfoToOnePlayer(iP2, DoGT.s_player2);
       
        ciNext.add(new ContinueItem(ispNew, this));
      }
    }
View Full Code Here
30
31
32
33
34
35
36
37
38
39
40
41
42
   
    // we now must create two outcomes corresponding to the player's 2 choices
   
    // Choice 1: Fold
    InfoSetPair ispFold = ispThisNode.addInfoToBoth(
        new InfoToken(infoType, InfoToken.s_fold));
    gtnFold = new TerminalLeafNode(new ContinueItem(ispFold, this));

    // Choice 2: Call
    ciCall = new ContinueItem(
        ispThisNode.addInfoToBoth(new InfoToken(infoType, InfoToken.s_call)),
        this);
  }
View Full Code Here
34
35
36
37
38
39
40
41
42
43
44
45
46
47
   
    for(int i = 0; i < numClusters; i++) {
      for(int j = 0; j < numClusters; j++) {
        // players {1,2} are assigned to clusters {i,j}
       
        InfoToken iP1 = new InfoToken(InfoToken.s_holeCardsCluster
            [DoGT.s_bc0][DoGT.s_player1], i);
       
        InfoToken iP2 = new InfoToken(InfoToken.s_holeCardsCluster
            [DoGT.s_bc0][DoGT.s_player2], j);
       
        InfoSetPair ispNew = isp.addInfoToOnePlayer(iP1, DoGT.s_player1)
            .addInfoToOnePlayer(iP2, DoGT.s_player2);
       
View Full Code Here
52
53
54
55
56
57
58
59
60
      numClusters[i] = header[i];
    }
    maxNumBoardCards = header[6];
   
    if(useContainer) {
      container = new RewardMatrixElement(0, 0, 0);
    }
    this.useContainer = useContainer;
  }
View Full Code Here
94
95
96
97
98
99
100
101
102
103
104
      // be careful about calling in.readXyz() once per field
      firstDim = in.readInt();
      secondDim = in.readInt();
      value = in.readFloat();
     
      return new RewardMatrixElement(firstDim, secondDim, value);
     
    } catch (BufferUnderflowException bue) {
      return null;
    }
   
View Full Code Here
TOP

Related Classes of stage3.NameMap

  • _io.ReadBinaryRmStream
  • stage3.ChanceRound
  • stage3.ContinueItem
  • stage3.GameTree.ChanceNode
  • stage3.GameTree.EndRoundChoiceNode
  • stage3.GameTree.MiddleRoundChoiceNode
  • stage3.InfoSet.InfoSetPair
  • stage3.InfoSet.InfoToken
  • java.io.BufferedReader
  • java.io.FileReader
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.