Automata

.docx

School

Grand Canyon University *

*We aren’t endorsed by this school

Course

201

Subject

Computer Science

Date

Apr 29, 2024

Type

docx

Pages

3

Uploaded by BaronScienceSpider29 on coursehero.com

Automata Dane Look Grand Canyon University CYB-201 Professor Michael Sarlo 10/23/22 1
Game programmers use the theory of Automata to create parts of games that can infinitely compute and can take care of themselves to automatically be self-reliant. Infinitely computing automata is important to game design because as it is computing within itself time after time, the chance of bugs within the game is decreased because the code is only repeating itself. The example for this is the game of pong, the ball is automatically moved and computed on its own to bounce between the two paddles that each of the players control; the players are in control of their paddles, but the movement of the ball, as well as the score are automatic. The final computations of pong happen when the score goes up for either player, but to get to that computation, the program has to decide which player the ball was hit by, and if the other player returned that hit to the first player or if they missed it, only through this configuration layer can the final result be achieved. Automata is best shown through visual representation, like shown below, because instead of showing many lines of code put in place to make the automation work and having to read and apply knowledge to that code to see how it works, a visual model takes all the code and compresses it into pictures explaining what that code does and how it applies to the next set of code in the automation depending on the outcome of the first set, this continues all the way down configurations to find a finite answer to what happens. This finite answer is reset to the start of the configurations every time the ball is hit by a player and ends when the one player scores against the other. Automata is connected to computer languages because code within the computer language is required to be written in order for automata to be used. The automatic part of the game has to be designed through a language and tested to be bug free before it can be introduced 2
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help