10.11 PROJ-3: Racko (Checkpoint A)In this project, you will implement the game of 'Rack-O, a game that involves rearranging your hand of cards in order to have an increasingsequence. Each card just has a number. While Racko is typically played with 2 to 4 players, we will keep this simple and just use twoplayers. One player's moves will be decided by the user via input. We will also build a computer player whose moves are decided by you, theprogrammer. This game will be built in stages: Checkpoint A, and Checkpoint B, and an extra credit Checkpoint C to participate in a Rackoclass competition!This Idea/concept application of this project was obtained from Dr. Bhusnurmath at the University of Pennsylvania.OverviewA Racko deck is composed of 60 cards, numbered 1 to 60. A hand is kept in a special place, called a rack. The objective is to be the firstplayer to arrange all of the cards in your rack from lowest to highest.To set-up the game, we shuffle the deck and each player gets dealt 10 cards one at a time. As a player receives a card, it is placed in theirrack (i.e., without rearranging any of them, in the order they were dealt). The goal of each player is to create a rack where the sequence ofcard numbers is in ascending order, starting at slot 1. Players will try to accomplish this by selectively discarding from their hand andreplacing with new cards.To start the game, the top card of the deck is turned over to create a discard pile.Each player then takes turns by:1. Taking the top card from either the discard pile or the deck2. Optionally discarding one card from their rack, and inserting the new card into the vacant slot0If a player draws a card from the deck, they may immediately discard it (rather than discard one from their rack)• If a player draws the top card from the discard, they must keep it (and discard one from their rack)The first player to get 10 cards in ascending order calls "Rack-O!" and wins the game.The following video explains the rules and gameplay of Racko:1815S4300:07/3:46.293440ALRACKOGALER9✪Implementation NotesYou will notice that, in a sense, the objective of Rack-O is to get a sorted rack, but it is not how we would traditionally consider "sorting" --none of our other sorting algorithms let us discard and select new elements!*Our project will make heavy use of lists. We will represent a player's rack, the deck and the discard pile as lists. Note that in both the deckand the discard pile, you only ever will access to the top card.• To add a card to a pile of cards, you just call the append method.To take a card from the top of a pile of cards, you just call the pop method. • To add a card to a pile of cards, you just call the append method.• To take a card from the top of a pile of cards, you just call the pop method.A player's rack can also be represented by a list. If their rack was:rack = [3, 17, 11, 30, 33, 38, 49, 46, 25, 531This rack is not yet "Rack-O', since it is not in ascending order.Checkpoint AIn Checkpoint A, the game will not yet be playable as a two-player game. It will be playable by you in a type of solitaire mode."Implement these functions from the template following the description (specification) in their docstring:.....• play_hand()The main function to drive the game has been provided.Missing input/output statements are part of play_hand () and left for you to implement, guided by the sample input/output.. None of the other functions left to implement use input or print.• The case / capitalization of user input should be ignored.. On any invalid user input, the program should exit with a non-zero exit code..Hint: Use Python Tutor, as much as possible when testing gameplay. Zybooks requires you specify all your inputs in advance and it is lessenjoyable to play that way.show_top_card()get_top_card()add_card_to_discard()check_racko()find_and_replace()Sample input/output 1When the inputs are:noyes1yes5yes7The expected behavior is (inputs are shown in-line)Deck: [8, 3, 21Discard pile: [4]Your current rack is: [5, 1, 7, 61The top discard card is 4Do you want it? (yes or no): noThe card from the deck is 2Do you want it? (yes or no): yesEnter the number of the card you want to kick out: 1Your new rack is: [5, 2, 7, 61Deck: [8, 31Discard pile: [4, 11Your current rack is: [5, 2, 7, 61The top discard card is 1

SOLUTION- I have solved this problem in python code with comments and screenshot for easy…

10.11 PROJ-3: Racko (Checkpoint A) In this project, you will implement the game of Rack-O; a game that involves rearranging your hand of cards in order to have an increasing sequence. Each card just has a number. While Racko is typically played with 2 to 4 players, we will keep this simple and just use two players. One player's moves will be decided by the user via input. We will also build a computer player whose moves are decided by you, the programmer. This game will be built in stages: Checkpoint A, and Checkpoint B, and an extra credit Checkpoint C to participate in a Racko class competition! This Idea/concept application of this project was obtained from Dr. Bhusnurmath at the University of Pennsylvania. Overview A Racko deck is composed of 60 cards, numbered 1 to 60. A hand is kept in a special place, called a rack. The objective is to be the first player to arrange all of the cards in your rack from lowest to highest. To set-up the game, we shuffle the deck and each player gets dealt 10 cards one at a time. As a player receives a card, it is placed in their rack (Le, without rearranging any of them, in the order they were dealt). The goal of each player is to create a rack where the sequence of card numbers is in ascending order, starting at slot 1. Players will try to accomplish this by selectively discarding from their hand and replacing with new cards. To start the game, the top card of the deck is turned over to create a discard pile. Each player then takes turns by: 1. Taking the top card from either the discard pile or the deck 2. Optionally discarding one card from their rack, and inserting the new card into the vacant slot If a player draws a card from the deck they may immediately discard it (rather than discard one from their rack)

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE