Select a game that can be modeled by a simple Turing machine. This means it will

Question

Select a game that can be modeled by a simple Turing machine. This means it will take a series of inputs (such as a set of moves by a player) and use the tape and table to compute the outcome of whether the player won or lost. Guessing games work well for this where the tape will house the guesses by the player in order. For example, when working with Turing machines, you may wish to represent the concept through a concentration game.

Use the criteria below and describe how the Turing machine will act on the input.

This week, Include the following in your report:

A brief explanation of the computing concepts to be modeled
A brief explanation of how the game functions if you created it
A brief explanation of the original game on which you have based your assignment if the game already exists
A brief explanation of how the game was integrated with the concepts of computing if the game already exists
Three scenarios of game play, including:
The setup of the game
The desired outcome
A sample game for each scenario


***Please list references and uses APA format**

Explanation / Answer

LogicPro : Hi, LogicPro : I will provide you answer ASAP. Customer : U do not have to rush.......this game thing is so confusing to me.....and as of now I am practicing on one....its not going good but its not going bad either....so maybe after looking at yours I can find my mistakes. LogicPro : ok Customer : thanx! LogicPro : welcome. LogicPro : Can you provide your files to me so that I can modify them. Customer : Hi! I am ready to review what you have! Customer : Hi!I'm ready to review wht you have! Customer : I must be done by @ am! Customer : Yes. Customer : That was why I submitted to you ahead of time just in case. Customer : I used a concept of hangman game the last time and I can use that again it just that concept has change. Review the instructions that I sent on 10/20........I.m a little confused and frustrated. Customer : Hi Logic Pro.......can this be converted to a Turing Machine? Customer : I'm sending it now....please give me about 10min. Customer : HANGMAN GAME SONYA GADSON THEORY OF COMPUTATION 1105 Hangman is a word guessing game. This game can be played between 2 or more players. One player selects a word and other players guess that word by guessing letters. The word to be guessed is represented by the row of dashes, equal to the number of letters in the word. If guessed letter is incorrect, a stick in the hangman is drawn. If guess is correct, it is written in the dashed word at the correct locations. If the hangman gets completed before the selected word completes, the player looses. If the selected word get completed before the hangman completes, user wins. EXAMPLE OF HANGMAN: The following is an example of Hangman game. The following example game illustrates a player trying to guess the word hangman using a strategy based solely on letter frequency. 0 ? Word: _ _ _ _ _ _ _ Guess: E Misses: 1 ? Word: _ _ _ _ _ _ _ Guess: T Misses: e 2 ? Word: _ _ _ _ _ _ _ Guess: A Misses: e,t 3 ? Word: _ A _ _ _ A _ Guess: O Misses: e,t 4 ? Word: _ A _ _ _ A _ Guess: I Misses: e,o,t 5 ? Word: _ A _ _ _ A _ Guess: S Misses: e,i,o,t 6 ? Word: _ A N _ _ A N Guess: N Misses: e,i,o,s,t 7 ? Word: _ A N _ _ A N Guess: H Misses: e,i,o,s,t 8 ? Word: H A N _ _ A N Guess: R Misses: e,i,o,s,t 9 ? Word: H A N _ _ A N Guess: Misses: e,i,o,r,s,t Guesser loses - the answer was HANGMAN. ALGORITHM FOR HANGMAN: Here is the algorithm for Hangman game: Clear the screen Define variables Create a list of words Use a loop to choose a random word from the list Set the number of tries to 0 Reset the array that monitors the variables to 0 Print the number of chances left Set the counter that monitors the number of occurrences of the letter pressed in word to 0 Use a loop Set variable foundletter to 0 Wait for user to press a letter Change the letter pressed to uppercase Check the key pressed If a letter has not been pressed yet Check whether the letter is found in the word if so increment counter by 1 Display letter on screen Set variable foundletter to TRUE end if If not found increment variable numberoftries by 1 Display number of chances left Set the array that monitors the variables to -1 end if loop until escape key is pressed or word found or no more chances left Say whether user has won or lost Ask if user want to play again loop until user presses letter n STATES FOR HANGMAN: This game has following states: State 1: Select a word from list State 2: User guesses the letter State 3: Draw Hangman State 4: User win State 4: User loose. AUTOMATA FOR HANGMAN: The automata for the Hangman game can be drawn as follows: At state 1, player will select a word from list. Then it will ask user to guess. Now the user will guess a letter repeatedly, if the guess is correct, user will remain at state 2, and the letter will be written at the correct locations. If the guess is incorrect, the user will move to state3. At state 3, hangman will be drawn. If the hangman is complete, user will move to state 5, which means user loose. At state 3, if the hangman is not complete, user will be moved to state 2 for another guess. At state 2, if the word completes, user will be moved to state 4, which means user wins. Customer : Can this be turned to a Turing Machine with the details that I need from my questions? Customer : Are you there? Customer : Wow......I never had this problem before with you. Customer : r u still here/ Customer : LogicPro......can you help me solve this?

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.