In this task, you will solve a concurrency problem using the key concepts: Processes, inter-process communication, client-server model, network programming, sockets, managing asynchronous i/o
You are to write a server and the client processed to act as a dealer and players for the card game, Black Jack. For the purposes of this assignment we will be using a simplified version of the rules for the game. These rules are to be realized in the server (and dealer) with a specific protocol which will allow ANY client process that also implements the protocol to connect to your server and play the game.
* Criteria that your server should satisfy include:
The server should be accessible from both local and remote sites. This means that the dealer and the player processes may reside on different machines, provided that these machines are connected by the Internet.
The master socket to which clients will connect should use port number 2000 + the last three digits of your student ID. For example, if your student ID is 223456, you should be using port number 2456. This port number should appear in the header of the document that will accompany your solution.
Busy-waiting must be avoided.
The server must support the protocol outlined below.
The game is played in ``rounds''. At the start of each round a number of player connections are accepted by the server, and a hand of blackjack played with each in accordance with the rules provided.
The server initiates a round by accepting the first available connection from its master socket. Player processes connect to the server to express their willingness to participate in the current round.
When a player first connects, it sends the server the magic word 0xdeadbeef. This word indicates to the server that this is an actual player that knows the rules of the game (and uses the correct protocol). A player that doesn't send this word within 5 seconds should be disconnected (its socket is closed) and ignored. Once the first player is authenticated, the server should proceed to accept additional players in the same fashion until:
*a total of 4 players have been accepted (initial + 3 more) OR
*30 seconds have elapsed since the first player requested a game,
at which point the ``table is closed''. The round then commences with the available player connections.
Once a set of players have been accepted as outlined above, the server should fork off a child process to execute the dealer process that will play the game with the connected players. The server should wait for the dealer to finish the round (child process terminates), at which point it should begin collecting players for a new round, and the process repeats itself. Note that the master socket is never closed.
The dealer begins by sending each player their cards, followed by the single visible dealer card (see format below). Note that the dealer will have up to 4 hands of its own (one for each player it is playing against). As soon as a player receives this information, it may begin playing its hand in accordance with the rules. Specifically, a player may send the message "HIT", to which the dealer will respond with another card (same format). Alternatively the player may send the message "STAND" to indicate that they are satisfied with their hand. If a "hit" results in the player going bust, the dealer disconnects the appropriate player connection after "dealing" (sending) the card---the dealer automatically wins that hand. Note that the dealer is aware of this since it can keep track of the player's hand,
Important: The dealer must process players' requests as soon as they are received; the dealer will have to monitor all connections for data simultaneously, rather than process them in round robin fashion.
6 freelancers are bidding on average $385 for this job
Hi! I can do this task for you. I have more than 10 years experience in developing C applications including banking and networking applications. Best regards.