Handsome squidward

(as a state machine)

By: Gia-Han Nguyen (gsn8vk)

Finite State Machines

State machines store the status of something that is controlled by an input, which gives a resulting output.

In this assignment I will model the transformations of Handsome Squidward as a state machine. I will outline the start state, following states, inputs, outputs, and the final state of his transition.

Start State - P(0)

In the start state, Squidward is a regular cephalopod working at a fast food restaurant. His looks can be considered subpar. This is the beginning state of a state machine.

Inputs

The input of this state machine is a door slam to Squidward’s face. This changes the state of Squidward’s looks and motivates the following states of the state machine.

** The videos may take a second to load

Second State - Handsome Squidward is born!

After getting hit by the door, Squidward is shown to have gotten better looking as a direct result of the injury. This is the second state of the state machine.

Following States - P(n)

The continuance of this state machine is shown as Squidward gets more handsome with every door slam - the input.

Outputs

The output of the Handsome Squidward state machine is stress. The more good looking Squidward gets [continuing states of P(n)], the more he is mobbed by the masses of Bikini Bottom, giving him stress.

Final State

The final state of the Handsome Squidward state machine comes when the stress outputted by the machine is greater than Squidward’s desire to be beautiful (a preset constant). Once this condition is met, Squidward hits his face against a pole, and returns to his normal looks. The program is exited!

To summarize

Terminating conditions met (stress > x) → program exits

Start State

Input: Door slam

​

Second State

Third State

Output: Stress

Squidward’s desire to be beautiful = x