CISC 3667 Game Design & Development Midterm Review

Fundamentals of Game Definition and Play

• Game Design Core Concept:

  • Game design is the deliberate practice of crafting a game's rules, formal mechanics, structures, and overall player experiences.
  • It encompasses systems engineering, psychological engagement, and interactive narrative design.

• Iterative Design Framework:

  • Iterative design is a continuous, cyclical methodology consisting of four distinct phases: designing, testing (playtesting), evaluating, and revising.
  • This cycle repeats continuously throughout development to refine game balance, usability, pacing, and emotional impact based on empirical observations rather than ungrounded assumptions.
  • Playtesting exposes edge cases, unintuitive interfaces, degenerate strategies, and unexpected player friction that cannot be detected through conceptual analysis alone.

• Lusory Attitude:

  • Defined as the psychological state in which a player willingly accepts the arbitrary rules and limitations of a game specifically to make the activity of play possible.
  • Without this voluntary acceptance, artificial constraints (such as refusing to touch a soccer ball with one's hands or restricting movement to specific squares on a board) cease to possess meaning or binding power.

• Theoretical Definitions of Games:

  • Kevin Maroney: Defines a game as a form of play characterized by goals and structure.
  • Jane McGonigal: Identifies four universal defining traits shared by all games:
  • Goal: The specific outcome that players work to achieve, focusing their attention and orienting their participation.
  • Rules: Limitations placed on how players can achieve the goal, fostering creativity and strategic thinking by removing obvious or effortless pathways.
  • Feedback System: Real-time indicators (points, levels, health bars, progress meters) telling players how close they are to achieving the goal.
  • Voluntary Participation: The explicit requirement that everyone who plays willingly knows and accepts the goal, the rules, and the feedback, establishing common ground and psychological safety.
  • Jesse Schell: Defines a game as a problem-solving activity approached with a playful attitude.
  • Chris Crawford: Formalizes an explicit taxonomic hierarchy of play activities based on systemic traits:
  • Play: An open-ended activity pursued without a quantified goal.
  • Toy: An interactive plaything with no assigned objective or victory condition (e.g., a set of building blocks).
  • Challenge: An activity that introduces a definite goal to be accomplished.
  • Puzzle: A static challenge with no active, reacting opponent.
  • Conflict: A dynamic challenge featuring an active opposing force or agent.
  • Competition: A conflict where opponents cannot actively interfere with or impede one another's progress (e.g., independent, parallel races or independent puzzle-solving contests).
  • Game: A conflict featuring an active opponent where participants can actively interfere with each other's progress and actions.
  • Bernard Suits: Defines game playing as the voluntary attempt to overcome unnecessary obstacles, emphasizing that games intentionally establish inefficient means to achieve arbitrary ends in order to create the experience of play.

Frameworks and Taxonomies of Fun

• Marc LeBlanc's Eight Kinds of Fun (Mechanics-Dynamics-Aesthetics Framework):

  • Sensation: Pleasure derived through direct sensory enjoyment and stimulation (audio, visual fidelity, tactile feedback).
  • Fantasy: Pleasure derived from make-believe, imaginative immersion, and pretending to exist in an alternate, fictional world.
  • Narrative: Pleasure derived from dramatic arc, story progression, emotional investment, and character development.
  • Challenge: Pleasure derived from overcoming obstacles, achieving mastery, and testing personal skill against difficulty.
  • Fellowship: Pleasure derived from social interaction, teamwork, community bonding, and collective participation.
  • Discovery: Pleasure derived from exploration, experimentation, charting unknown territories, and uncovering hidden secrets.
  • Expression: Pleasure derived from individual creativity, personalization, character customization, self-designed aesthetics, and personal style.
  • Submission (Abnegation): Pleasure derived from relaxation, mindless pastime, escapism, repetitive comforting rhythms, and passing time effortlessly.

• Nicole Lazzaro's Four Keys 2 Fun:

  • Hard Fun: Centered on challenge, strategy, mastery, tension, and the accomplishment experienced through prevailing over difficulty ("fiero").
  • Easy Fun: Centered on curiosity, wonder, exploration, roleplay, and casual interaction without high stakes.
  • Serious Fun: Centered on meaning, purposeful impact, personal value, real-world utility, and catharsis or emotional resonance.
  • People Fun: Centered on social connection, competition, cooperation, amusement with peers, and shared interactive experiences.

• Multifaceted Engagement:

  • Games rarely rely on a single isolated emotional category; rich interactive titles regularly combine multiple kinds of fun simultaneously to appeal to diverse player motivations and sustain long-term engagement.

Bartle's Player Types

• Richard Bartle's Player Taxonomy:
  • Achievers:
  • Primary motivation: Accumulation of concrete game rewards, points, levels, equipment, achievement trophies, and system completion.
  • Behavioral traits: Methodically grind, pursue complete completionist milestones, and measure satisfaction through quantitative progression metrics.
  • Explorers:
  • Primary motivation: Discovering the game world, hidden mechanics, internal systems, edge cases, and systemic physics.
  • Behavioral traits: Delight in mapping unrevealed areas, experimenting with undocumented interactions, finding easter eggs, and understanding system depth.
  • Socializers:
  • Primary motivation: Interacting, communicating, and building relationships with other human beings.
  • Behavioral traits: Treat the game mechanics primarily as a backdrop or shared space for conversation, guild coordination, empathy, and collaborative socialization.
  • Killers:
  • Primary motivation: Imposing will, exercising dominance, and engaging in direct adversarial competition against other players.
  • Behavioral traits: Seek victory specifically through disrupting, outmaneuvering, and defeating other human competitors.
  • Fluidity of Types: Players do not belong strictly to mutually exclusive categories; an individual may exhibit characteristics across multiple types depending on context, game mode, or mood.

The Elemental Tetrad and Mechanics Architecture

• Jesse Schell's Elemental Tetrad:

  • Mechanics: The formal rules, procedures, interactive affordances, systems, and actions available to players. Dictates how the game actually functions.
  • Story: The linear or branching sequence of events, narrative premise, drama, and world lore.
  • Aesthetics: The sensory presentation of the game, including visual design, user interface, sound design, musical score, and physical feel.
  • Technology: The physical or digital medium, hardware, software engines, materials, paper, or code through which the mechanics, story, and aesthetics are executed.
  • Systemic Interdependence: None of the four elements exists in isolation. A modification in one element inevitably impacts, constrains, or amplifies the other three.

• Objects, Attributes, and States:

  • Object: A distinct entity or item within the game system (e.g., a player character, an enemy monster, an inventory weapon, a tile).
  • Attribute: An inherent category, characteristic, or property possessed by an object (e.g., current health, maximum velocity, defensive rating, ammo count).
  • State: The exact, real-time value assigned to an attribute at a specific moment in time (e.g., $50\,\text{HP}$, $12\,\text{m/s}$, $0\,\text{ammo}$).

• Action Hierarchies:

  • Basic Actions: Low-level, atomic operations explicitly permitted directly by the game rules or controller mapping (e.g., pressing a button to jump, rolling a six-sided die, moving a piece forward one square).
  • Strategic Actions: High-level decisions and emergent combinations of basic actions enacted over time to achieve an advantageous position or long-term objective (e.g., baiting an opponent into a trap, sacrificing a valuable chess piece to control the center of the board).

Rules, Player Typology, and Emergent Behavior

• Taxonomy of Rules:

  • Operational Rules: Explicit instructions and procedures detailing how play proceeds, what steps players execute, and how physical or digital inputs correspond to movements.
  • Foundational Rules: The underlying mathematical, logical, and formal architecture governing the game state beneath the operational veneer.
  • Behavioral Rules: Implicit cultural, social, and contextual expectations governing sportsmanship, conduct, etiquette, and mutual respect among players.
  • Written Rules: Formalized documentation, manuals, rulebooks, and tutorials presented directly to players.
  • House Rules: Informal modifications, additions, or omissions devised by specific player groups to alter existing game parameters for custom play sessions.

• Player Typology and Rule Adherence:

  • Standard Player: Accepts the formal rules and plays in alignment with both the operational instructions and the intended spirit of the game.
  • Dedicated Player: Adheres strictly to the formal rules while passionately pursuing high-level optimization, competitive mastery, and victory.
  • Unsportsmanlike Player: Abides by the letter of the formal rules but deliberately violates behavioral rules and the cooperative spirit of fair play (e.g., time stalling, taunting, toxic conduct).
  • Cheat: Deliberately breaks formal operational or foundational rules to obtain an unearned advantage while attempting to conceal the infraction.
  • Spoil-Sport: Explicitly refuses to acknowledge the legitimacy of the rules, leaves mid-game, destroys pieces, or disrupts the game environment so that play collapses entirely.

• Pathologies of Game Balance:

  • Degenerate Strategy: A tactic or sequence of moves that is consistently and overwhelmingly effective compared to all other options, rendering diverse strategies non-viable and destroying meaningful strategic choice.
  • Exploit: Capitalizing on an unintended design oversight, glitch, or unexpected system interaction within the programming or rules to achieve an unfair advantage.

Feedback Systems and Dynamic Difficulty Adjustment

• System Dynamics and Feedback Loops:

  • A feedback loop occurs when the output of a system feeds back into the system as an input, directly influencing future states and performance.

• Positive Feedback Loops:

  • Definition: A mechanism that amplifies changes, differences, and initial advantages, driving the system further away from equilibrium.
  • Gameplay Consequence: Generates a "snowball effect" or "runaway leader" dynamic. An initial victory confers additional resources, making successive victories easier, while trailing players fall exponentially further behind.
  • Example: In strategic board games, capturing an opponent's territory yields bonus income every turn, financing a larger army that facilitates capturing even more territory.

• Negative Feedback Loops:

  • Definition: A mechanism that dampens changes and counteracts disparities, actively driving the system back toward balance and equilibrium.
  • Gameplay Consequence: Operates as a stabilizing force, often realized through "rubberbanding" or "catch-up mechanics" to keep contests close and maintain dramatic tension.
  • Example: In racing games, racers trailing behind receive powerful speed boosts and offensive weapons, whereas racers in first place receive weak, defensive items.

• Dynamic Difficulty Adjustment (DDA):

  • An automated algorithmic process in which a game continuously tracks player performance metrics (e.g., death counts, accuracy, time-to-clear) and dynamically modulates gameplay parameters in real time.
  • Modulated factors include enemy health, enemy artificial intelligence aggressiveness, item drops, and obstacle timing.
  • The goal is to keep the player continuously in psychological "flow," preventing boredom from excessive ease and frustration from overwhelming difficulty (e.g., gifting extra health packs to a player who has died repeatedly at a boss).

Probability Theory, Statistics, and Mathematical Modeling in Games

• Foundational Probability Concepts:

  • Randomness: The occurrence of events whose individual outcomes cannot be deterministically predicted.
  • Probability: The quantified mathematical measure of the likelihood that a particular outcome will occur.
  • Theoretical Probability: The mathematically expected likelihood of an event calculated analytically based on all possible equiprobable outcomes.
  • Practical Probability (Empirical Probability): The actual observed relative frequency of an event over a finite series of real-world trials or empirical experiments.

• Cognitive Fallacies of Probability:

  • Gambler's Fallacy: The irrational belief that if an independent random event has occurred less frequently than expected in the past, it becomes more likely to occur in the future (e.g., claiming "I have lost five coin tosses in a row, so a win is due").
  • Lucky Streak Fallacy (Hot Hand Fallacy): The irrational belief that because a random event has occurred repeatedly in the past, it has established momentum and is more likely to continue occurring (e.g., claiming "I have won five dice rolls in a row, so I am on a streak and will win again").
  • Fact of Independence: For truly independent random events, past trials have zero mathematical bearing on the outcome of subsequent trials.

• Core Mathematical Probability Formulas:

  • Probability of an Event (assuming all elementary outcomes are equally likely):     $P(A) = \frac{\text{Favorable outcomes}}{\text{Total possible outcomes}}$
  • Complementary Probability:     $P(\text{not } A) = 1 - P(A)$
  • Expected Value ($EV$): The weighted average outcome expected over an arbitrarily large number of repetitions:     $EV = \sum (\text{Outcome} \times \text{Probability})$
  • Bayes' Theorem: Updates the conditional probability of an event or hypothesis $A$ based on the arrival of new evidence $B$:     $P(A|B) = \frac{P(B|A) \times P(A)}{P(B)}$
  • Where:
    • $P(A|B)$: Posterior probability of $A$ given that $B$ has occurred.
    • $P(B|A)$: Likelihood of observing evidence $B$ given hypothesis $A$.
    • $P(A)$: Prior probability of hypothesis $A$ before observing evidence.
    • $P(B)$: Marginal probability of observing evidence $B$ across all conditions.

• Dice Distribution Realities:

  • Rolling two standard six-sided dice ($2d6$) produces $6 \times 6 = 36$ ordered outcomes.
  • Total sums range from $2$ to $12$, but outcomes are not uniformly distributed because there are asymmetrical combinations for different sums:
  • Total of $2$: $(1, 1)$ (1 outcome; $P = \frac{1}{36}$).
  • Total of $7$: $(1, 6), (2, 5), (3, 4), (4, 3), (5, 2), (6, 1)$ (6 outcomes; $P = \frac{6}{36} = \frac{1}{6}$).
  • Total of $12$: $(6, 6)$ (1 outcome; $P = \frac{1}{36}$).

Game Balance, Decision Architecture, and Strategy

• Defining Game Balance:

  • Game balance is the intentional calibration of systems, player powers, resource flows, and challenges to produce the designer's intended player experience while preventing unintended dominant strategies.

• Balance Typologies:

  • Symmetrical Balance: All players start with identical or mathematically equivalent resources, abilities, mechanics, and objectives (e.g., standard Chess, Checkers, Pong).
  • Asymmetrical Balance: Players possess fundamentally distinct abilities, starting resources, units, or victory conditions, yet maintain roughly equal chances of winning over skilled play (e.g., fighting games with distinct character archetypes, real-time strategy factions like StarCraft).
  • Circular Balance: Systemic interactions where options exist in a cyclical relationship of mutual vulnerability, ensuring no single option dominates entirely (e.g., Rock-Paper-Scissors).

• Decision Architecture and Meaningful Choice:

  • Challenge Calibration: Game systems must occupy the middle ground between trivial ease (which induces boredom) and insurmountable difficulty (which induces frustration).
  • Meaningful Choice: A decision in which the player possesses informed agency, distinct viable options, clear consequences, and where the chosen action significantly shapes the gameplay trajectory or final outcome.
  • Dominant Strategy: An option or sequence of choices that consistently yields superior outcomes regardless of what opponents do, thereby collapsing all meaningful choice into a single optimal route.
  • Triangularity (Risk vs. Reward vs. Certainty):
  • A fundamental design principle dictating that choices must balance risk, reward, and certainty against one another.
  • Low-risk actions yield low, highly certain rewards.
  • High-risk actions yield high, uncertain rewards.
  • If a high-reward option carries no corresponding risk or low certainty, it breaks triangularity and becomes a dominant strategy.

JavaScript Architecture and Game Logic Implementation

• Core Language Components in Game Systems:

  • Game Logic: Programmatic algorithms and execution rules that parse input, enforce mechanics, calculate interactions, and update the global game state.
  • Variables: Memory locations storing dynamic operational values (e.g., player score, remaining health, positional coordinates).
  • Objects: Composite data structures grouping related attributes and methods under key-value pairs (e.g., character stats, entity coordinates).
  • Arrays: Ordered, zero-indexed collections of elements storing sequential data (e.g., game boards, inventory slots, list of enemies).
  • Functions: Encapsulated, reusable blocks of instructions executed when invoked to perform calculations or trigger state mutations.
  • Conditional Statements: Branching control structures (if, else if, else) that apply operational rules based on Boolean truth evaluation.

• JavaScript Operators Reference:

• = : Assignment operator; assigns the right-hand value to a variable.

• === : Strict equality; evaluates if two operands are equal in value and type without type coercion.

• !== : Strict inequality; evaluates if two operands differ in value or type.

• >, <, >=, <= : Relational comparison operators; evaluate numeric/lexicographic orders.

• && : Logical AND; evaluates to true only if both expressions are truthy.

• || : Logical OR; evaluates to true if at least one expression is truthy.

• ! : Logical NOT; inverts the Boolean truth value of an expression.

• ++ : Increment operator; increases an integer variable's value by $1$.

• += : Addition assignment; adds the right operand to the variable and assigns the result.

• -= : Subtraction assignment; subtracts the right operand from the variable and assigns the result.

  • Engine and Runtime Architecture:

• Events: System or user actions occurring in the browser (e.g., mouse clicks, key presses, form submissions, page loads).

• Event Listeners: Asynchronous observers registered to listen for specific events and invoke handler functions upon triggering.

• DOM (Document Object Model): Object representation of the HTML document structure, allowing JavaScript to programmatically read, manipulate, and restyle visual elements.

• Game Loop: The central architectural heartbeat running continuously, divided into two distinct operational steps:

  • update(): Parses inputs, resolves physics, evaluates game rules, and mutates variables representing the game state.
  • draw(): Reads the mutated game state and renders the visual presentation to the display screen or canvas. The draw() routine should never mutate underlying rules or primary state logic.

• Collision Detection: Geometric algorithms verifying whether boundaries of two or more entities intersect or overlap, triggering mechanical consequences upon contact.

• Delta Time ($\Delta t$): The precise elapsed time between consecutive rendering frames, utilized as a multiplier in physics calculations to ensure uniform movement speed across varying display refresh rates.

• Timing Functions:

  • setTimeout(fn, delay): Schedules a callback function to execute once after a specified millisecond delay.
  • setInterval(fn, delay): Repeatedly executes a callback function at fixed millisecond intervals.
  • requestAnimationFrame(fn): Schedules a callback function to execute immediately prior to the browser's next screen repaint, synchronizing frame rates efficiently with the display monitor.

Midterm Review Examination: Questions and Complete Solutions

Part A: Definitions and Short Response Solutions

• Question 1: Jane McGonigal's Four Defining Traits of Games:

  • Traits: Goal, rules, feedback system, and voluntary participation.
  • Explanation: The goal provides focus; rules set artificial constraints to encourage creative problem-solving; the feedback system tracks progress; and voluntary participation guarantees all players freely accept these terms.

• Question 2: Lusory Attitude and Bernard Suits' Definition:

  • Lusory Attitude: The psychological state in which a player voluntarily accepts arbitrary rules and artificial limitations simply to make the act of playing possible.
  • Relation to Suits: Suits defines playing a game as "the voluntary attempt to overcome unnecessary obstacles." The lusory attitude is the exact mindset that accepts those unnecessary obstacles (e.g., agreeing not to handle a soccer ball with one's hands).

• Question 3: Iterative Design and the Role of Playtesting:

  • Iterative Design: A cyclical design methodology comprising repeated phases of prototyping, testing, evaluating, and revising.
  • Importance of Playtesting: Playtesting provides direct observational data on how actual players interact with the game, exposing balance flaws, ambiguous mechanics, and friction points that theoretical design cannot reveal.

• Question 4: LeBlanc's Challenge vs. Discovery Fun:

  • Challenge: The pleasure derived from overcoming difficult obstacles, solving intricate problems, and mastering systems through personal skill.
  • Discovery: The pleasure derived from exploring unknown worlds, testing systemic boundaries, charting new spaces, and uncovering hidden items or lore.

• Question 5: Lazzaro's Hard Fun vs. Easy Fun:

  • Hard Fun: Rooted in challenge, mastery, strategy, tension, and the pride of accomplishment (fiero) upon succeeding against difficult odds.
  • Easy Fun: Rooted in curiosity, casual exploration, lightweight roleplay, and sensory engagement without demanding high technical execution.

• Question 6: Bartle's Achievers vs. Explorers:

  • Achievers: Driven primarily by concrete rewards, quantified scores, rank, equipment upgrades, and complete completion of system objectives.
  • Explorers: Driven primarily by mapping the boundaries of the world, testing physical mechanics, finding hidden secrets, and understanding complex internal systems.

• Question 7: The Elemental Tetrad:

  • Mechanics: The rules, procedures, actions, and constraints defining how the game operates.
  • Story: The sequence of events, narrative premise, characters, and dramatic arc.
  • Aesthetics: The sensory presentation (graphics, music, sound design, UI) shaping the emotional tone.
  • Technology: The physical materials, hardware platforms, or software code that implement the other three elements.

• Question 8: Object, Attribute, and State:

  • Object: An entity within the game system (e.g., a player character).
  • Attribute: A property or characteristic possessed by that object (e.g., health).
  • State: The current value of that property at a specific moment in time (e.g., $50\,\text{HP}$).

• Question 9: Basic Action vs. Strategic Action:

  • Basic Action: A fundamental atomic action directly permitted by the game rules or controller mapping (e.g., moving a single chess piece to a legal square).
  • Strategic Action: A complex, high-level plan or sequence of basic actions executed to gain an advantage (e.g., sacrificing a knight to expose the opponent's king).

• Question 10: Operational Rules vs. Foundational Rules:

  • Operational Rules: The direct, outward instructions explaining to players how to interact with the game and execute turns.
  • Foundational Rules: The underlying mathematical, logical, and structural framework governing the system states beneath the operational layer.

• Question 11: Unsportsmanlike Player vs. Cheater:

  • Unsportsmanlike Player: Abides by the letter of the formal rules but deliberately violates behavioral expectations and the spirit of fair play (e.g., stalling the clock, verbal taunting).
  • Cheater: Actively breaks the formal operational or foundational rules to gain an unfair advantage while attempting to avoid detection.

• Question 12: Degenerate Strategy and Game Balance:

  • Degenerate Strategy: A tactic that is overwhelmingly effective compared to all other options, rendering diverse gameplay choices obsolete.
  • Impact on Balance: Destroys meaningful choice by forcing players to either adopt the single dominant strategy or consistently lose.

• Question 13: Positive vs. Negative Feedback Loops:

  • Positive Feedback Loop: Amplifies advantages or performance changes, causing a snowball effect that moves the system further from equilibrium (e.g., gaining extra resources by capturing territory).
  • Negative Feedback Loop: Counteracts disparities, stabilizing the system and pulling it back toward equilibrium (e.g., giving powerful catch-up items to trailing players).

• Question 14: Dynamic Difficulty Adjustment (DDA):

  • Definition: An algorithmic process that dynamically modifies difficulty parameters (enemy health, spawn rates, item availability) based on real-time player performance.
  • Player Experience: Maintains player engagement within the "flow" channel by alleviating frustrating roadblocks for struggling players and preventing boredom for advanced players.

• Question 15: Theoretical vs. Practical Probability:

  • Theoretical Probability: The mathematically predicted likelihood calculated analytically across all equiprobable outcomes.
  • Practical Probability: The empirical relative frequency calculated from observed results over a finite number of physical or digital trials.

• Question 16: Gambler's Fallacy vs. Lucky Streak Fallacy:

  • Gambler's Fallacy: The false belief that an outcome is overdue because it has not occurred recently.
  • Lucky Streak Fallacy: The false belief that an outcome is more likely to repeat simply because it has occurred multiple times in a row.

• Question 17: Symmetrical vs. Asymmetrical Balance:

  • Symmetrical Balance: All players have identical or mathematically equivalent abilities, resources, and win conditions.
  • Asymmetrical Balance: Players possess fundamentally distinct abilities, starting conditions, or mechanics, yet maintain equitable chances of winning through balanced matchups.

• Question 18: Meaningful Choice in Game Design:

  • Definition: A decision where the player has informed agency, distinct viable options, visible trade-offs, and where the outcome noticeably alters the game state or future tactical options.

• Question 19: Triangularity and Risk vs. Reward:

  • Triangularity: The design principle balancing risk, reward, and certainty.
  • Relation: Safe actions provide low, guaranteed rewards, while high rewards require players to accept substantial risk and low certainty. It ensures no single choice is universally superior.

• Question 20: Game State in JavaScript:

  • Game State: The complete snapshot of all active dynamic variables and data structures defining the game at a given instant.
  • Examples: let score = 100; and let playerLives = 3;.

• Question 21: Purpose of update() and draw() in a Game Loop:

  • update(): Calculates physics, resolves input, evaluates game rules, and updates variable values representing the game state.
  • draw(): Takes the updated state data and renders the visual presentation to the screen without altering the underlying logic.

• Question 22: Collision Detection and Game State:

  • Collision Detection: Algorithmic checks to determine whether two or more objects occupy overlapping geometric coordinates in game space.
  • State Effect: When a collision occurs, it triggers state mutations defined by the rules (e.g., reducing health, incrementing score, or destroying an object).

Part B: True or False Evaluations and Explanations

• Statement 1: Competition is one of Jane McGonigal's four defining traits of games:

  • Evaluation: False.
  • Justification: The four defining traits identified by Jane McGonigal are goal, rules, feedback system, and voluntary participation. Many games are cooperative or single-player and do not involve competition.

• Statement 2: A lusory attitude involves voluntarily accepting a game's rules and limitations:

  • Evaluation: True.
  • Justification: By definition, a lusory attitude is the psychological willingness to accept artificial constraints so that the activity of play can occur.

• Statement 3: LeBlanc's Eight Kinds of Fun are mutually exclusive:

  • Evaluation: False.
  • Justification: Games frequently combine multiple categories of fun simultaneously (e.g., an RPG blending Narrative, Fantasy, Challenge, and Discovery).

• Statement 4: Bartle's Socializers primarily enjoy interacting and forming relationships with other players:

  • Evaluation: True.
  • Justification: Socializers are motivated by human-to-human connection, using the game systems primarily as a social venue.

• Statement 5: The four elements of the Elemental Tetrad can influence one another:

  • Evaluation: True.
  • Justification: Mechanics, Story, Aesthetics, and Technology are deeply interconnected; a change in any single component inevitably affects the remaining three.

• Statement 6: An attribute represents the current value of an object's property, while a state represents the property itself:

  • Evaluation: False.
  • Justification: The definitions are reversed. An attribute is the property itself (e.g., health), while the state is the current value assigned to that property (e.g., $50\,\text{HP}$).

• Statement 7: Behavioral rules involve expectations about appropriate player behavior and sportsmanship:

  • Evaluation: True.
  • Justification: Behavioral rules govern etiquette, mutual respect, and unwritten cultural standards of fair conduct during play.

• Statement 8: A player who uses an unusual but legal strategy is automatically cheating:

  • Evaluation: False.
  • Justification: Cheating requires breaking formal rules. An unusual or unexpected legal strategy may be degenerate or unconventional, but it does not violate formal rules.

• Statement 9: Positive feedback loops can cause an advantage to grow over time:

  • Evaluation: True.
  • Justification: Positive feedback reinforces and magnifies advantages, producing a snowball effect where winning leads to further victory.

• Statement 10: Negative feedback loops always make a game easier for every player:

  • Evaluation: False.
  • Justification: Negative feedback counteracts differences by helping the trailing player and/or penalizing the leading player (e.g., rubberbanding in racing games makes the experience harder for the leader).

• Statement 11: Dynamic Difficulty Adjustment can respond to a player's performance:

  • Evaluation: True.
  • Justification: DDA systems continuously track performance metrics and dynamically modulate game parameters to maintain balanced challenge.

• Statement 12: When rolling two six-sided dice, all possible totals are equally likely:

  • Evaluation: False.
  • Justification: The totals range from $2$ to $12$ with unequal probabilities because sums like $7$ have 6 combinations, while sums like $2$ or $12$ have only 1 combination.

• Statement 13: If a fair coin lands on heads five times in a row, tails becomes more likely on the next flip:

  • Evaluation: False.
  • Justification: Coin tosses are independent events. The probability of landing on tails on any fair flip remains strictly $0.5$ ($50\%$), regardless of past outcomes.

• Statement 14: Expected value represents the average outcome expected over many occurrences:

  • Evaluation: True.
  • Justification: Expected value is the probability-weighted mathematical average of an event calculated over an infinite number of trials.

• Statement 15: An asymmetrical game can still be balanced and fair:

  • Evaluation: True.
  • Justification: Asymmetrical games provide players with distinct abilities, factions, or mechanics while maintaining balanced win rates across competitive play.

• Statement 16: A dominant strategy can reduce meaningful choices:

  • Evaluation: True.
  • Justification: If a single strategy is consistently superior to all alternatives, choosing any other tactic becomes suboptimal, eliminating strategic diversity.

• Statement 17: JavaScript arrays begin at index 1:

  • Evaluation: False.
  • Justification: JavaScript arrays are zero-indexed, meaning the initial element is stored at index 0.

• Statement 18: The JavaScript expression score += 5 is equivalent to score = score + 5:

  • Evaluation: True.
  • Justification: The += operator is an addition assignment shortcut that adds the right-hand value to the variable and reassigns the sum.

• Statement 19: The logical OR operator (||) requires both conditions to be true:

  • Evaluation: False.
  • Justification: The logical OR operator evaluates to true if at least one operand is truthy. The logical AND operator (&&) requires both conditions to be true.

• Statement 20: The draw() function is generally responsible for changing a game's rules and updating its state:

  • Evaluation: False.
  • Justification: The draw() function is responsible solely for visual rendering. State updates and rule evaluations belong inside the update() function.

• Statement 21: A JavaScript object can store multiple attributes of a game character:

  • Evaluation: True.
  • Justification: JavaScript objects group multiple key-value pairs, making them standard structures for storing properties like health, speed, and position.

• Statement 22: requestAnimationFrame() can be used to repeatedly schedule frames in a JavaScript game:

  • Evaluation: True.
  • Justification: requestAnimationFrame() schedules a callback before the next browser repaint, enabling smooth, hardware-synchronized game loops.

Part C: Multiple Choice Questions and Detailed Explanations

• Question 1: Jesse Schell's Definition of a Game:

  • Options: A. A form of play with goals and structure. | B. A voluntary attempt to overcome unnecessary obstacles. | C. A problem-solving activity approached with a playful attitude. | D. An activity defined by goals, rules, feedback systems, and voluntary participation.
  • Correct Answer: C. A problem-solving activity approached with a playful attitude.
  • Explanation: Option A is Kevin Maroney's definition, Option B is Bernard Suits' definition, and Option D represents Jane McGonigal's four traits.

• Question 2: Child Building Blocks Activity Classification (Chris Crawford):

  • Options: A. Puzzle | B. Toy | C. Challenge | D. Game
  • Correct Answer: B. Toy
  • Explanation: Under Crawford's taxonomy, an interactive plaything lacking an explicit goal, scoring system, or opposing force is categorized as a toy.

• Question 3: Timed Independent Puzzle-Solving Contest (Chris Crawford):

  • Options: A. A puzzle | B. A conflict | C. A competition | D. A game
  • Correct Answer: C. A competition
  • Explanation: Crawford defines a competition as a conflict where opponents strive toward a goal with active human agents, but cannot directly interfere with each other's progress. If interference were possible, it would be classified as a game.

• Question 4: Character Customization and Exploring for Hidden Furniture (Marc LeBlanc):

  • Options: A. Expression and Discovery | B. Fantasy and Challenge | C. Fellowship and Submission | D. Narrative and Sensation
  • Correct Answer: A. Expression and Discovery
  • Explanation: Designing houses and clothing reflects Expression (creativity and personal customization), while finding hidden furniture across the world reflects Discovery (exploration).

• Question 5: Basic Action vs. Strategic Action Example:

  • Options: A. Pressing a button to jump is a strategic action, while deciding when to jump is a basic action. | B. Moving a chess piece is a basic action, while sacrificing a piece to gain a positional advantage is a strategic action. | C. Basic actions are always simple, while strategic actions must involve multiple players. | D. Basic actions are defined by the game's story, while strategic actions are defined by its technology.
  • Correct Answer: B. Moving a chess piece is a basic action, while sacrificing a piece to gain a positional advantage is a strategic action.
  • Explanation: Moving a piece is an atomic operation directly allowed by the formal rules (basic action); sacrificing a piece to gain long-term positional superiority is a high-level tactical combination (strategic action).

• Question 6: Changing Die Roll Rules from One Die to Sum of Two Dice:

  • Options: A. The group has changed a behavioral rule because players are expected to follow the new procedure. | B. The group has created a house rule that modifies the game's operational rules. | C. The group has changed only the game's aesthetics because the objective remains the same. | D. The group has created a foundational rule without affecting how the game is played.
  • Correct Answer: B. The group has created a house rule that modifies the game's operational rules.
  • Explanation: Modifying how turns are executed and how pieces move changes the operational rules. Because this change was devised unofficially by the players, it is a house rule.

• Question 7: Unfair Legal Strategy in the Community:

  • Options: A. The player is automatically cheating because the strategy is unfair. | B. The player is a spoil-sport because they are attempting to win. | C. The strategy may be degenerate, and its use may raise concerns about behavioral rules without necessarily being cheating. | D. The strategy cannot be considered problematic because it is permitted by the formal rules.
  • Correct Answer: C. The strategy may be degenerate, and its use may raise concerns about behavioral rules without necessarily being cheating.
  • Explanation: Because the move does not violate written operational rules, it is not cheating. However, if it undermines competitive viability, it represents a degenerate strategy that strains behavioral rules.

• Question 8: Territory Yields Resources to Build Armies and Take More Territory:

  • Options: A. It is a negative feedback loop because capturing territory changes the game's state. | B. It is a positive feedback loop because an initial advantage can create further advantages. | C. It is DDA because the game automatically changes difficulty. | D. It is circular balance because players have multiple strategic options.
  • Correct Answer: B. It is a positive feedback loop because an initial advantage can create further advantages.
  • Explanation: This loop amplifies advantages over time, compounding success into a larger army and creating a snowball effect.

• Question 9: Racing Game Item Distribution Error:

  • Options: A. The intended system uses positive feedback, and the error creates negative feedback. | B. The intended system uses negative feedback, while the error may reinforce the leading player's advantage. | C. Both systems are examples of negative feedback because items are distributed randomly. | D. Both systems are examples of DDA because the game changes item distribution.
  • Correct Answer: B. The intended system uses negative feedback, while the error may reinforce the leading player's advantage.
  • Explanation: Giving strong items to trailing players is negative feedback designed to restore equilibrium. Erroneously giving those items to the front runner creates an unintended positive feedback effect.

• Question 10: Rolling a Fair Six-Sided Die 120 Times with 26 Sixes Recorded:

  • Options: A. Rolling a 6 occurred approximately 5 percentage points less frequently than theoretically expected, suggesting the die may be biased. | B. Rolling a 6 occurred approximately 5 percentage points more frequently than theoretically expected, but this does not change the probability of rolling a 6 on the next roll. | C. Rolling a 6 occurred approximately 5 percentage points more frequently than theoretically expected, suggesting this pattern is likely to continue. | D. Rolling a 6 occurred approximately 5 percentage points less frequently than theoretically expected, but the difference should disappear after enough additional rolls.
  • Correct Answer: B. Rolling a 6 occurred approximately 5 percentage points more frequently than theoretically expected, but this does not change the probability of rolling a 6 on the next roll.
  • Explanation: Theoretical probability is $\frac{1}{6} \approx 16.67\%$. Practical probability is $\frac{26}{120} \approx 21.67\%$, which is $5\%$ higher. Because dice rolls are independent, the next roll's probability remains $\frac{1}{6}$.

• Question 11: Character A (Fast, Low Damage) vs. Character B (Slow, High Damage):

  • Options: A. The game demonstrates symmetrical balance because both characters can win. | B. The game demonstrates asymmetrical balance because different abilities can remain competitively viable. | C. The game demonstrates circular balance because one character must always defeat the other. | D. The game is necessarily unbalanced because the characters have different abilities.
  • Correct Answer: B. The game demonstrates asymmetrical balance because different abilities can remain competitively viable.
  • Explanation: The characters feature fundamentally different mechanical attributes, yet both maintain balanced odds of victory.

• Question 12: JavaScript Execution Tracing:

  • Options: A. score = 8, gameOver = false | B. score = 13, gameOver = false | C. score = 13, gameOver = true | D. score = 8, gameOver = true
  • Correct Answer: C. score = 13, gameOver = true
  • Explanation:
  • In the first check, score >= 10 || health <= 20 evaluates false || true (since health is 20), which is true. score += 5 executes, changing score from 8 to 13.
  • In the second check, score >= 10 && health > 0 evaluates 13 >= 10 && 20 > 0, which is true && true (true). Therefore, gameOver = true executes.

Part D: Probability and Game Balance Calculations

• Question 1: Basic Probability on a Fair Six-Sided Die:

  • a. Probability of rolling a number greater than 4:
  • Favorable outcomes: numbers strictly greater than $4$ are $\{5, 6\}$ ($2$ outcomes).
  • Total possible outcomes: $\{1, 2, 3, 4, 5, 6\}$ ($6$ outcomes).
  • Calculation:       $P(>4) = \frac{2}{6} = \frac{1}{3}$
  • b. Probability of NOT rolling a number greater than 4:
  • Using the complement rule:       $P(\le 4) = 1 - P(>4) = 1 - \frac{1}{3} = \frac{2}{3}$
  • c. Fractional Form:
  • Probability of greater than $4$: $\frac{1}{3}$.
  • Probability of not greater than $4$: $\frac{2}{3}$.

• Question 2: Two Fair Six-Sided Dice:

  • a. Total possible ordered outcomes:
  • Rolling two independent six-sided dice yields:       $6 \times 6 = 36\,\text{outcomes}$
  • b. Probability of rolling a total of 7:
  • Favorable pairs $(d_1, d_2)$: $(1, 6), (2, 5), (3, 4), (4, 3), (5, 2), (6, 1)$ ($6$ combinations).
  • Calculation:       $P(\text{Total } 7) = \frac{6}{36} = \frac{1}{6}$
  • c. Probability of rolling a total of 12:
  • Favorable pairs: $(6, 6)$ ($1$ combination).
  • Calculation:       $P(\text{Total } 12) = \frac{1}{36}$
  • d. Explanation of Difference:
  • The probabilities differ because there are $6$ unique permutations of two dice that sum to $7$, whereas there is only $1$ permutation that sums to $12$.

• Question 3: Practical Probability from Finite Trials:

  • a. Practical probability of rolling a 6 (12 times in 80 rolls):     $P_{\text{practical}}(6) = \frac{12}{80} = \frac{3}{20} = 0.15 = 15\%$
  • b. Theoretical probability of rolling a 6:     $P_{\text{theoretical}}(6) = \frac{1}{6} \approx 0.1667 = 16.67\%$
  • c. Explanation of Difference:
  • Practical probability reflects empirical trials subject to random variance in a finite sample size ($80$ rolls). Theoretical probability represents the infinite mathematical limit.

• Question 4: Expected Value Calculation:

• a. Calculation of Expected Value ($EV$):     $EV = \sum (\text{Reward} \times P(\text{Reward}))$$EV = (2 \times 0.50) + (5 \times 0.30) + (10 \times 0.20)$$EV = 1.00 + 1.50 + 2.00 = 4.50\,\text{coins}$

• b. Meaning of Expected Value:

  • It represents the long-term mathematical average payout per chest if a player opens a large number of chests.

• c. Single Chest Guarantee Analysis:

  • No. An individual chest cannot reward $4.50$ coins because the discrete payouts are strictly $2$, $5$, or $10$ coins. Expected value is a statistical average across many trials, not a possible result from a single trial.

  • Question 5: Risk, Reward, and Triangularity:

• a. Expected Damage Calculations:

  • Safe Attack ($100\%$ chance for $6$ damage):       $EV_{\text{safe}} = 6 \times 1.00 = 6.0\,\text{damage}$
  • Risky Attack ($40\%$ chance for $18$ damage, $60\%$ chance for $0$ damage):       $EV_{\text{risky}} = (18 \times 0.40) + (0 \times 0.60) = 7.20 + 0 = 7.2\,\text{damage}$

• b. Higher Expected Value:

  • The Risky Attack has the higher expected value ($7.2 > 6.0$).

• c. Strategic Rationale for the Lower EV Attack:

  • If an enemy has $6$ or fewer health points remaining, the Safe Attack guarantees a kill. Choosing the Risky Attack introduces a $60\%$ chance of dealing zero damage, leaving the player vulnerable to counterattack.

• d. Relationship to Triangularity:

  • Triangularity creates a trade-off between certainty and potential yield. The Safe Attack offers $100\%$ certainty with modest payout, while the Risky Attack offers higher upside ($18$ damage, higher $EV$) offset by low certainty ($40\%$).

  • Question 6: Bayes' Theorem Calculation:

• Given:

  • $P(\text{Rare}) = 0.40$
  • $P(\text{Common}) = 0.60$
  • $P(\text{Gem}|\text{Rare}) = 0.80$
  • $P(\text{Gem}|\text{Common}) = 0.20$

• a. Value of $P(\text{Rare})$:     $P(\text{Rare}) = 0.40$

• b. Value of $P(\text{Gem}|\text{Rare})$:     $P(\text{Gem}|\text{Rare}) = 0.80$

• c. Overall Probability of finding a gem, $P(\text{Gem})$:

  • Using the Law of Total Probability:       $P(\text{Gem}) = [P(\text{Gem}|\text{Rare}) \times P(\text{Rare})] + [P(\text{Gem}|\text{Common}) \times P(\text{Common})]$$P(\text{Gem}) = (0.80 \times 0.40) + (0.20 \times 0.60)$$P(\text{Gem}) = 0.32 + 0.12 = 0.44$

• d. Probability chest was rare given it contained a gem, $P(\text{Rare}|\text{Gem})$:

  • Applying Bayes' Theorem:       $P(\text{Rare}|\text{Gem}) = \frac{P(\text{Gem}|\text{Rare}) \times P(\text{Rare})}{P(\text{Gem})}$$P(\text{Rare}|\text{Gem}) = \frac{0.80 \times 0.40}{0.44} = \frac{0.32}{0.44} = \frac{8}{11} \approx 0.7273 = 72.73\%$

Part E: JavaScript Code Tracing

• Initial Code Base Analysis:

  • board array initial state:
  • Index 0: "X" | Index 1: "O" | Index 2: ""
  • Index 3: "" | Index 4: "X" | Index 5: ""
  • Index 6: "O" | Index 7: "" | Index 8: ""
  • Initial variables: currentPlayer = "X", winner = "".

• Step-by-Step Execution Sequence:

  • Execution Step 1: makeMove(2):
  • Check: board[2] !== "" || winner !== "" is false || false (false).
  • Action: board[2] = "X".
  • Check: checkWinner() evaluates all combinations. None match three non-empty identical values. winner remains "".
  • Turn toggle: winner === "" is true. currentPlayer updates to "O".
  • Execution Step 2: makeMove(3):
  • Check: board[3] !== "" || winner !== "" is false || false (false).
  • Action: board[3] = "O".
  • Check: checkWinner() evaluates all combinations. None match. winner remains "".
  • Turn toggle: winner === "" is true. currentPlayer updates to "X".
  • Execution Step 3: makeMove(8):
  • Check: board[8] !== "" || winner !== "" is false || false (false).
  • Action: board[8] = "X".
  • Check: checkWinner() evaluates condition [0, 4, 8].
    • board[0] ("X"), board[4] ("X"), board[8] ("X").
    • All three indices equal "X". Condition is satisfied.
    • winner = board[0] sets winner = "X" and returns.
  • Turn toggle: winner === "" is false. currentPlayer does not toggle and remains "X".
  • Execution Step 4: makeMove(5):
  • Check: board[5] !== "" || winner !== "" evaluates false || true (true).
  • Guard clause activates: return; executes immediately. No changes occur.
  • Execution Step 5: makeMove(7):
  • Check: board[7] !== "" || winner !== "" evaluates false || true (true).
  • Guard clause activates: return; executes immediately. No changes occur.

• Final State Solutions:

  • a. Final values in specified board indices:
  • board[2]: "X"
  • board[3]: "O"
  • board[5]: ""
  • board[7]: ""
  • board[8]: "X"
  • b. Final value of currentPlayer:
  • "X"
  • c. Final value of winner:
  • "X" (Player X wins).
  • d. Winning condition satisfied:
  • Indices [0, 4, 8] from the winningConditions array (diagonal line from top-left to bottom-right).

Part F: JavaScript Code Writing Solutions

• Question 1: Score and Winning Condition Implementation:

function addPoints(points) {
  score += points;
  if (score >= 20) {
    gameWon = true;
  }
}

• Question 2: Bounded Player Movement Implementation:

player.x += player.speed;
if (player.x > 100) {
  player.x = 100;
}

• Question 3: Item Collection and Milestone Bonus Implementation:

function collectItem() {
  itemsCollected++;
  score += 10;
  if (itemsCollected === 5) {
    score += 20;
  }
}

• Question 4: Damage Calculation and Game Over State Implementation:

function takeDamage(amount) {
  health -= amount;
  if (health <= 0) {
    gameOver = true;
  }
}