Added Software Engineering II code

OSU Coursework/CS 362 - Software Engineering II/1 - Dominion Unit Testing/dominion.h

@@ -0,0 +1,142 @@
+#ifndef _DOMINION_H
+#define _DOMINION_H
+
+// Code from various sources, baseline from Kristen Bartosz
+
+#define MAX_HAND 500
+#define MAX_DECK 500
+
+#define MAX_PLAYERS 4
+
+#define DEBUG 0
+
+//Testing commit
+
+/* http://dominion.diehrstraits.com has card texts */
+/* http://dominion.isotropic.org has other stuff */
+
+/* hand# means index of a card in current active player's hand */
+
+enum CARD
+  {curse = 0,
+   estate,
+   duchy,
+   province,
+
+   copper,
+   silver,
+   gold,
+
+   adventurer,
+   /* If no/only 1 treasure found, stop when full deck seen */
+   council_room,
+   feast, /* choice1 is supply # of card gained) */
+   gardens,
+   mine, /* choice1 is hand# of money to trash, choice2 is supply# of
+	    money to put in hand */
+   remodel, /* choice1 is hand# of card to remodel, choice2 is supply# */
+   smithy,
+   village,
+
+   baron, /* choice1: boolean for discard of estate */
+   /* Discard is always of first (lowest index) estate */
+   great_hall,
+   minion, /* choice1:  1 = +2 coin, 2 = redraw */
+   steward, /* choice1: 1 = +2 card, 2 = +2 coin, 3 = trash 2 (choice2,3) */
+   tribute,
+
+   ambassador, /* choice1 = hand#, choice2 = number to return to supply */
+   cutpurse,
+   embargo, /* choice1 = supply# */
+   outpost,
+   salvager, /* choice1 = hand# to trash */
+   sea_hag,
+   treasure_map
+  };
+
+struct gameState {
+  int numPlayers; //number of players
+  int supplyCount[treasure_map+1];  //this is the amount of a specific type of card given a specific number.
+  int embargoTokens[treasure_map+1];
+  int outpostPlayed;
+  int outpostTurn;
+  int whoseTurn;
+  int phase;
+  int numActions; /* Starts at 1 each turn */
+  int coins; /* Use as you see fit! */
+  int numBuys; /* Starts at 1 each turn */
+  int hand[MAX_PLAYERS][MAX_HAND];
+  int handCount[MAX_PLAYERS];
+  int deck[MAX_PLAYERS][MAX_DECK];
+  int deckCount[MAX_PLAYERS];
+  int discard[MAX_PLAYERS][MAX_DECK];
+  int discardCount[MAX_PLAYERS];
+  int playedCards[MAX_DECK];
+  int playedCardCount;
+};
+
+/* All functions return -1 on failure, and DO NOT CHANGE GAME STATE;
+   unless specified for other return, return 0 on success */
+
+struct gameState* newGame();
+
+int* kingdomCards(int k1, int k2, int k3, int k4, int k5, int k6, int k7,
+		  int k8, int k9, int k10);
+
+int initializeGame(int numPlayers, int kingdomCards[10], int randomSeed,
+		   struct gameState *state);
+/* Responsible for initializing all supplies, and shuffling deck and
+   drawing starting hands for all players.  Check that 10 cards selected
+   are in fact (different) kingdom cards, and that numPlayers is valid.
+
+Cards not in game should initialize supply position to -1 */
+
+int shuffle(int player, struct gameState *state);
+/* Assumes all cards are now in deck array (or hand/played):  discard is
+ empty */
+
+int playCard(int handPos, int choice1, int choice2, int choice3,
+	     struct gameState *state);
+/* Play card with index handPos from current player's hand */
+
+int buyCard(int supplyPos, struct gameState *state);
+/* Buy card with supply index supplyPos */
+
+int numHandCards(struct gameState *state);
+/* How many cards current player has in hand */
+
+int handCard(int handNum, struct gameState *state);
+/* enum value of indexed card in player's hand */
+
+int supplyCount(int card, struct gameState *state);
+/* How many of given card are left in supply */
+
+int fullDeckCount(int player, int card, struct gameState *state);
+/* Here deck = hand + discard + deck */
+
+int whoseTurn(struct gameState *state);
+
+int endTurn(struct gameState *state);
+/* Must do phase C and advance to next player; do not advance whose turn
+   if game is over */
+
+int isGameOver(struct gameState *state);
+
+int scoreFor(int player, struct gameState *state);
+/* Negative here does not mean invalid; scores may be negative,
+   -9999 means invalid input */
+
+int getWinners(int players[MAX_PLAYERS], struct gameState *state);
+/* Set array position of each player who won (remember ties!) to
+   1, others to 0 */
+
+int playAdventurer(struct gameState *state);
+int playSmithy(struct gameState *state, int handPos);
+int playVillage(struct gameState *state, int handPos);
+int playFeast(struct gameState *state, int choice1);
+int playCouncil_Room(struct gameState *state, int handPos);
+int playGreat_Hall(struct gameState *state, int handPos);
+int playOutpost(struct gameState *state, int handPos);
+
+
+#endif