Package org.gnubridge.core

Examples of org.gnubridge.core.Deal

25
26
27
28
29
30
31
32
33
34
35
  public void testEquivaltenceVariousPruneStrategies() {
    for (int cardDeal = 0; cardDeal < DEALS_TO_TRY; cardDeal++) {
      monkeys = new ArrayList<SearchMonkey>();
      Trump trump = determineTrump(cardDeal);
      g = new Deal(trump);
      GameUtils.initializeRandom(g, CARDS_TO_DEAL);
      System.out.println("*********** DEAL " + cardDeal + " ***********");
      g.playOneTrick(); //somewhat randomizes who's to move next
      g.printHands();
      g.printHandsDebug();
View Full Code Here
51
52
53
54
55
56
57
58
59
60
61
    int CARDS_TO_DEAL = 4;
    int DEALS_TO_TRY = 25;
    for (int cardDeal = 0; cardDeal < DEALS_TO_TRY; cardDeal++) {
      monkeys = new ArrayList<SearchMonkey>();
      Trump trump = determineTrump(cardDeal);
      g = new Deal(trump);
      GameUtils.initializeRandom(g, CARDS_TO_DEAL);
      System.out.println("*********** DEAL " + cardDeal + " ***********");
      g.playOneTrick(); //somewhat randomizes who's to move next
      g.printHands();
      g.printHandsDebug();
View Full Code Here
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
    Card secondMove = second.getBestMove();
    System.out.println("#####>  Search strategies " + first + " and " + second
        + " differ on what is the best move ( " + firstMove + " versus " + secondMove + "). "
        + "Now comparing tricks taken if each evaluates the other's best move.");

    Deal firstMovePlayed = originalGame.duplicate();
    firstMovePlayed.play(firstMove);
    firstMovePlayed.printHandsDebug();
    SearchMonkey firstProxy = new SearchMonkey(first.config);
    SearchMonkey secondProxy = new SearchMonkey(second.config);
    firstProxy.runSearch(firstMovePlayed.duplicate());
    secondProxy.runSearch(firstMovePlayed.duplicate());
    firstProxy.printAsTree();
    secondProxy.printAsTree();
    assertEquals("played " + firstMove + " as recommended by " + firstProxy, firstProxy.getNorthSouthTricks(),
        secondProxy.getNorthSouthTricks());
    int tricksTakenIfFirstMovePlayed = firstProxy.getNorthSouthTricks();

    Deal secondMovePlayed = originalGame.duplicate();
    secondMovePlayed.play(secondMove);
    firstProxy.runSearch(secondMovePlayed);
    secondProxy.runSearch(secondMovePlayed);
    assertEquals("played " + firstMove + " as recommended by " + secondProxy, firstProxy.getNorthSouthTricks(),
        secondProxy.getNorthSouthTricks());
    int tricksTakenIfSecondMovePlayed = firstProxy.getNorthSouthTricks();
View Full Code Here
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
    assertEquals(1, s.getBestMoves().size());
  }

  public void testIfCannotBeatPlayLowestToColorPruningNoConflictWithSequencePruning() {

    Deal game = new Deal(NoTrump.i());
    game.getPlayer(Direction.WEST_DEPRECATED).init(new Card[] { Ace.of(Spades.i()), Nine.of(Spades.i()) });
    game.getPlayer(Direction.NORTH_DEPRECATED).init(new Card[] { Five.of(Spades.i()), Four.of(Spades.i()) });
    game.getPlayer(Direction.EAST_DEPRECATED).init(new Card[] { Ten.of(Hearts.i()), Three.of(Hearts.i()) });
    game.getPlayer(Direction.SOUTH_DEPRECATED).init(new Card[] { Six.of(Hearts.i()), Two.of(Hearts.i()) });

    game.setNextToPlay(Direction.WEST_DEPRECATED);
    game.play(Ace.of(Spades.i()));
    DoubleDummySolver pruned = new DoubleDummySolver(game.duplicate());
    Node root = new Node(null);
    pruned.examinePosition(root);
    assertNotNull(root.getBestMove());

  }
View Full Code Here
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
  }

  public void testShortCircuitIfRootOnlyHasOneValidMove() {

    Deal game = new Deal(NoTrump.i());
    game.getPlayer(Direction.WEST_DEPRECATED).init(new Card[] { Ace.of(Spades.i()), Nine.of(Spades.i()) });
    game.getPlayer(Direction.NORTH_DEPRECATED).init(new Card[] { Six.of(Spades.i()), Four.of(Hearts.i()) });
    game.getPlayer(Direction.EAST_DEPRECATED).init(new Card[] { Ten.of(Hearts.i()), Three.of(Hearts.i()) });
    game.getPlayer(Direction.SOUTH_DEPRECATED).init(new Card[] { Six.of(Hearts.i()), Two.of(Hearts.i()) });

    game.setNextToPlay(Direction.WEST_DEPRECATED);
    game.play(Ace.of(Spades.i()));
    DoubleDummySolver pruned = new DoubleDummySolver(game.duplicate());
    pruned.setTerminateIfRootOnlyHasOneValidMove(true);
    pruned.search();
    assertEquals(1, pruned.getPositionsExamined());

  }
View Full Code Here
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
  }

  public void testIfAllMovesTheSameChooseLowestValueCard() {

    Deal game = new Deal(NoTrump.i());
    game.getPlayer(Direction.WEST_DEPRECATED).init(new Card[] { Ace.of(Spades.i()), Queen.of(Spades.i()) });
    game.getPlayer(Direction.NORTH_DEPRECATED).init(new Card[] { Six.of(Spades.i()), Four.of(Spades.i()) });
    game.getPlayer(Direction.EAST_DEPRECATED).init(new Card[] { Ten.of(Hearts.i()), Three.of(Hearts.i()) });
    game.getPlayer(Direction.SOUTH_DEPRECATED).init(new Card[] { Six.of(Hearts.i()), Two.of(Hearts.i()) });

    game.setNextToPlay(Direction.WEST_DEPRECATED);
    DoubleDummySolver pruned = new DoubleDummySolver(game.duplicate());
    //  pruned.useAlphaBetaPruning(false);
    pruned.search();
    assertEquals(Queen.of(Spades.i()), pruned.getRoot().getBestMove().getCardPlayed());

    Deal gameWithCardsFlipped = new Deal(NoTrump.i());
    gameWithCardsFlipped.getPlayer(Direction.WEST_DEPRECATED).init(
        new Card[] { Queen.of(Spades.i()), Ace.of(Spades.i()) });
    gameWithCardsFlipped.getPlayer(Direction.NORTH_DEPRECATED).init(
        new Card[] { Six.of(Spades.i()), Four.of(Spades.i()) });
    gameWithCardsFlipped.getPlayer(Direction.EAST_DEPRECATED).init(
        new Card[] { Ten.of(Hearts.i()), Three.of(Hearts.i()) });
    gameWithCardsFlipped.getPlayer(Direction.SOUTH_DEPRECATED).init(
        new Card[] { Six.of(Hearts.i()), Two.of(Hearts.i()) });

    gameWithCardsFlipped.setNextToPlay(Direction.WEST_DEPRECATED);
    DoubleDummySolver triangulate = new DoubleDummySolver(gameWithCardsFlipped.duplicate());

    //  triangulate.useAlphaBetaPruning(false);
    triangulate.search();
    assertEquals(Queen.of(Spades.i()), triangulate.getRoot().getBestMove().getCardPlayed());
View Full Code Here
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
  }

  public void testIfAllMovesLoseSameChooseLowestValueCard() {

    Deal game = new Deal(NoTrump.i());
    game.getPlayer(Direction.WEST_DEPRECATED).init(new Card[] { Ace.of(Spades.i()), King.of(Spades.i()) });
    game.getPlayer(Direction.NORTH_DEPRECATED).init(new Card[] { Six.of(Diamonds.i()), Four.of(Hearts.i()) });
    game.getPlayer(Direction.EAST_DEPRECATED).init(new Card[] { Ten.of(Hearts.i()), Three.of(Hearts.i()) });
    game.getPlayer(Direction.SOUTH_DEPRECATED).init(new Card[] { Six.of(Hearts.i()), Two.of(Hearts.i()) });

    game.setNextToPlay(Direction.WEST_DEPRECATED);
    game.play(Ace.of(Spades.i()));
    DoubleDummySolver pruned = new DoubleDummySolver(game.duplicate());
    pruned.search();
    assertEquals(Four.of(Hearts.i()), pruned.getRoot().getBestMove().getCardPlayed());
    Deal gameWithCardsFlipped = new Deal(NoTrump.i());
    gameWithCardsFlipped.getPlayer(Direction.WEST_DEPRECATED).init(
        new Card[] { Ace.of(Spades.i()), King.of(Spades.i()) });
    gameWithCardsFlipped.getPlayer(Direction.NORTH_DEPRECATED).init(
        new Card[] { Four.of(Hearts.i()), Six.of(Diamonds.i()) });
    gameWithCardsFlipped.getPlayer(Direction.EAST_DEPRECATED).init(
        new Card[] { Ten.of(Hearts.i()), Three.of(Hearts.i()) });
    gameWithCardsFlipped.getPlayer(Direction.SOUTH_DEPRECATED).init(
        new Card[] { Six.of(Hearts.i()), Two.of(Hearts.i()) });

    gameWithCardsFlipped.setNextToPlay(Direction.WEST_DEPRECATED);
    gameWithCardsFlipped.play(Ace.of(Spades.i()));
    DoubleDummySolver triangulate = new DoubleDummySolver(gameWithCardsFlipped.duplicate());
    //triangulate.pruneAlphaBeta = false;
    triangulate.search();
    assertEquals(Four.of(Hearts.i()), triangulate.getRoot().getBestMove().getCardPlayed());

  }
View Full Code Here
30
31
32
33
34
35
36
37
38
39
40
41
42
        scoringTracker);

  }

  private Deal repositionHandsSoThatSouthIsDeclarer(Auctioneer a, Deal cardHolder) {
    Deal result = new Deal(a.getHighBid().getTrump());
    result.getPlayer(a.getDummyOffsetDirection(North.i())).init(cardHolder.getPlayer(North.i()).getHand());
    result.getPlayer(a.getDummyOffsetDirection(East.i())).init(cardHolder.getPlayer(East.i()).getHand());
    result.getPlayer(a.getDummyOffsetDirection(South.i())).init(cardHolder.getPlayer(South.i()).getHand());
    result.getPlayer(a.getDummyOffsetDirection(West.i())).init(cardHolder.getPlayer(West.i()).getHand());
    result.setNextToPlay(West.i().getValue());
    return result;
  }
View Full Code Here
24
25
26
27
28
29
30
31
32
33
34
35
36
import org.gnubridge.core.deck.Two;
import org.gnubridge.presentation.GameUtils;

public class TestPositionLookup extends TestCase {
  public void testSameObjectShownTwice() {
    Deal g = new Deal(NoTrump.i());
    GameUtils.initializeSingleColorSuits(g);
    g.playOneTrick();

    PositionLookup pl = new PositionLookup();
    Node node = new Node(null);
    assertFalse(pl.positionEncountered(g, node.getTricksTaken()));
    assertTrue(pl.positionEncountered(g, node.getTricksTaken()));
View Full Code Here
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
    assertEquals(node.getTricksTaken(), pl.getNode(g));
  }

  @SuppressWarnings("unused")
  public void testOnlyReturnFirstNodeEncountetredForThePosition() {
    Deal g = new Deal(NoTrump.i());
    GameUtils.initializeSingleColorSuits(g);
    g.playOneTrick();

    PositionLookup pl = new PositionLookup();
    Node node = new Node(null);
    boolean justPresentThePosition = pl.positionEncountered(g, node.getTricksTaken());

    Deal identicalTwin = new Deal(NoTrump.i());
    GameUtils.initializeSingleColorSuits(identicalTwin);
    identicalTwin.playOneTrick();

    Node identicalTwinNode = new Node(null);
    assertTrue(pl.positionEncountered(identicalTwin, identicalTwinNode.getTricksTaken()));
    assertEquals(node.getTricksTaken(), pl.getNode(identicalTwin));
View Full Code Here
TOP

Related Classes of org.gnubridge.core.Deal

  • org.gnubridge.core.bidding.BiddingAgentStochasticTest
  • org.gnubridge.presentation.gui.BiddingAcceptanceTest
  • org.gnubridge.presentation.gui.MainController
  • org.gnubridge.presentation.gui.PlayAcceptanceTest
  • org.gnubridge.search.DoubleDummyScenarioTestCase
  • org.gnubridge.search.DoubleDummySolver
  • org.gnubridge.search.DoubleDummySolverScenarioAcceptanceTest
  • org.gnubridge.search.DoubleDummySolverTest
  • org.gnubridge.search.StochasticDoubleDummySolverAcceptanceTest
  • org.gnubridge.search.TestPositionLookup
    • 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.