Question: In C code Information: Go Fish (https://en.wikipedia.org/wiki/Go Fish) is a card game that can be played by two or more players. The game is played

In C code

In C code Information: Go Fish (https://en.wikipedia.org/wiki/Go Fish) is a card gamethat can be played by two or more players. The game isplayed by each player takes turn asking for a card with aspecific rank or face from another player. The goal is to forma book (a set of 4 cards with the same face or

Information: Go Fish (https://en.wikipedia.org/wiki/Go Fish) is a card game that can be played by two or more players. The game is played by each player takes turn asking for a card with a specific rank or face from another player. The goal is to form a book (a set of 4 cards with the same face or rank) The winner is the player who has the most number of books at the end of the game. a) For two players, each player starts with 7 cards. The rest of the cards are put in the center so that each player can take a card when needed. Let's call two players: Wilbur (a user) and PC (a computer). After each player gets 7 cards on his/her hand, the players take turn asking for the card. b) Wilbur first asks PC for the card of a particular rank or face value If PC has card(s) with that rank, - PC has to give all the cards with that rank to Wilbur and - Wilbur gets another turn (to ask for a card) " "If PC has no card with that rank, - PC says "Go Fish" and - Wilbur has to take one card from the center pile and put it in his hand. If the card drawn from the center pile is the card that Wilbur originally asked for, he gets another turn (to ask for a card). Otherwise, it is PC's turn. d) When it's PC turn to ask for a card from Wilbur, same rules above are applied. When any player has all 4 cards of the same face or rank value (the 4 cards form a "book", i.e., 9 of diamonds (),9 of spade (+), 9 of club (+),9 of heart ()), the book must be shown face up (to show that the player gets that book) If at any given time, the player has no card on his/her hand, he/she has to take 7 cards from the center pile (or as many cards as the center pile has available at that time) to continue the game . e) The game continues until all 13 books 12-9, J, Q, K, A) are found. The winner is the player with the most numbers of books. Project requirements: For this project your team will write the card game Go Fish, for which you will use a standard deck of 52 cards. There will be only 2 players, the computer and one user. After each player gets 7 cards on his/her hand, the user will start first. To simulate the deck of 52 cards, and each of the hands, your team MUST use a dynamic list of cards with the following struct type typedef struct card s char suit; int face struct card s *next; car Each card consists of a suit [clubs (+), spades (+), hearts (, or diamonds (+) A face (1(Ace), 2 10, Jacks (O), Queens (Q), and Kings (K)) Note: you can modify the above struct (i.e. changing the data type of member(s), add more members,) but you cannot remove the already existing members in the given struct. 1) The 52-card deck must be implemented using the linked list. Each hand (computer or user) must be implemented using the linked list. Information: Go Fish (https://en.wikipedia.org/wiki/Go Fish) is a card game that can be played by two or more players. The game is played by each player takes turn asking for a card with a specific rank or face from another player. The goal is to form a book (a set of 4 cards with the same face or rank) The winner is the player who has the most number of books at the end of the game. a) For two players, each player starts with 7 cards. The rest of the cards are put in the center so that each player can take a card when needed. Let's call two players: Wilbur (a user) and PC (a computer). After each player gets 7 cards on his/her hand, the players take turn asking for the card. b) Wilbur first asks PC for the card of a particular rank or face value If PC has card(s) with that rank, - PC has to give all the cards with that rank to Wilbur and - Wilbur gets another turn (to ask for a card) " "If PC has no card with that rank, - PC says "Go Fish" and - Wilbur has to take one card from the center pile and put it in his hand. If the card drawn from the center pile is the card that Wilbur originally asked for, he gets another turn (to ask for a card). Otherwise, it is PC's turn. d) When it's PC turn to ask for a card from Wilbur, same rules above are applied. When any player has all 4 cards of the same face or rank value (the 4 cards form a "book", i.e., 9 of diamonds (),9 of spade (+), 9 of club (+),9 of heart ()), the book must be shown face up (to show that the player gets that book) If at any given time, the player has no card on his/her hand, he/she has to take 7 cards from the center pile (or as many cards as the center pile has available at that time) to continue the game . e) The game continues until all 13 books 12-9, J, Q, K, A) are found. The winner is the player with the most numbers of books. Project requirements: For this project your team will write the card game Go Fish, for which you will use a standard deck of 52 cards. There will be only 2 players, the computer and one user. After each player gets 7 cards on his/her hand, the user will start first. To simulate the deck of 52 cards, and each of the hands, your team MUST use a dynamic list of cards with the following struct type typedef struct card s char suit; int face struct card s *next; car Each card consists of a suit [clubs (+), spades (+), hearts (, or diamonds (+) A face (1(Ace), 2 10, Jacks (O), Queens (Q), and Kings (K)) Note: you can modify the above struct (i.e. changing the data type of member(s), add more members,) but you cannot remove the already existing members in the given struct. 1) The 52-card deck must be implemented using the linked list. Each hand (computer or user) must be implemented using the linked list

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!