A game of Hex (Work with multiple processes using Visual Studio)

Project includes Graphical User Interface. You are to implement a game of Hex. Your implementation should consist of three processes. Each process must have a visible window as it runs. The main process is the manager. It should start the other two (player) processes and manage the game. It is responsible for evaluating the game and declaring a winner or a tie. The player processes may be two copies of the same program. Use whatever mechanism you wish to coordinate among the manager and the player processes. You must include enough information in the displays of the player processes to convince me that the two processes are making the moves. Hex is a 2-player game. In this case the two players are the child processes. You will simulate a 6x6 hex board. Here is a sample board. The rules of Hex are deceptively simple: The players take turns placing opposite colored markers on empty hexagons on the board. The players attempt to connect opposite sides of the board with a continuous line of pieces. (The line does not have to be horizontal or diagonal – it can twist and turn as it crosses the board. The first player must connect the (more or less) vertical sides, and the second player must connect the horizontal sides. The first player to connect his two sides of the board is the winner. For more information, see "[login to view URL]". You can get a lot of information from internet about this game and sample programs. You must show a game board on the manager process window so that the user can see the status of the game. The board does not have to be this elaborate. The manager process will tell one of the player processes to make a move. Once the move is made and communicated back to the manager, the manager will update its display, decide if there is a winner, and if not, will wait for the user to click a button on the manager display before the next move is made. (Deciding if there is a winner may end up being one of the more interesting challenges of this lab.) It will then ask the other player to make a move. The player processes do not have to have a strategy - they can just move at random. It will probably be more interesting if you try to make a player’s next move somewhere close to its last move, although I believe it has been proved that the game can never end in a draw. If the parent process detects a winner, it should display a message in its window about the outcome of the game and give the user an option to play again or terminate the game. If the user elects to terminate the game then the parent should end the game in an orderly way: i.e., the child processes should be stopped first and then the parent process can terminate. Again, this should be done in such a manner that the I could see that each child (or both) has ended before the parent ends. If the user elects to play again then the players will have to be able to reinitialize the game and to realize that they are being told to do so. Three different types of game mode are possible: Computer vs. Human, Computer vs. Computer, and Human vs. Human. You must provide Computer vs. Human mode. The other two modes, i.e., Computer vs. Computer or Human vs. Human are optional. Note that the game itself is not the point of this lab. If you need to make assumptions, do so. Write-up You should submit a write-up as well as your program. Your write-up should include any known bugs, limitations, and assumptions in your program. This write-up should be in text-format and titled as ‘README’. It should be submitted along with your code. I will use the ‘README’ file to compile (or install) and run your program.