AL-702-A AI in Gaming - Nov 2023 Question Paper

Under each question, How to answer lists the points an answer should cover, outlined by CampusPrep from the syllabus. Check the details against your textbook.

1. 7 Marks
   aDefine Game Theory. How does it apply to Artificial Intelligence?
   How to answer

   • Define game theory as study of strategic decision-making among rational players
   • Explain players, strategies, payoffs, equilibrium concepts
   • Explain application to AI: adversarial search, minimax, game playing agents
   • Give gaming examples like chess, poker, video game NPC decisions
2. 7 Marks
   bDiscuss with various functions used in Minimax algorithm.
   How to answer

   • Define Minimax algorithm for two-player zero-sum games
   • Explain max node, min node, utility evaluation function
   • Explain recursive traversal, terminal test and backup of values
   • Explain role in game tree search with example
3. 7 Marks
   aExplain about rule-based systems with an example.
   How to answer

   • Define rule-based system: knowledge base, rules, inference engine
   • Explain IF-THEN rules and forward/backward chaining
   • Give gaming example e.g., NPC behavior rules
   • Mention advantages and limitations
4. 7 Marks
   bDifferentiate between static representation and kinematic representation in 3D.
   How to answer

   • Define static representation: position, orientation without motion
   • Define kinematic representation: position plus velocity, acceleration
   • Compare on parameters, data needed, use in steering behaviors
   • Give 3D gaming examples
5. 7 Marks
   aDescribe about the components of coordinated movement in detail.
   How to answer

   • Define coordinated movement and its need in games
   • Describe components: formation, leader, slots, steering, communication
   • Explain arrival, separation and alignment roles
   • Give example of group NPC movement
6. 7 Marks
   bDraw the movement of algorithm structure and explain each component in detail.
   How to answer

   • Draw block diagram of movement algorithm structure: kinematic, steering, locomotion
   • Explain input character state and output motion
   • Explain role of each component in pipeline
   • Relate to game character animation
7. 7 Marks
   aDiscuss with A* path finding algorithm with an example.
   How to answer

   • Define A* with f(n)=g(n)+h(n) formula
   • Explain open list, closed list and heuristic selection
   • Work through grid example step by step
   • Mention optimality and gaming pathfinding use
8. 7 Marks
   bImplement breadth first search algorithm for path finding with an example.
   How to answer

   • Define BFS using queue and level-order expansion
   • Give pseudocode steps for path finding
   • Trace on example graph/grid from start to goal
   • Mention completeness, complexity and gaming use
9. 7 Marks
   a"The problem's tendency to decrease the efficiency for solving a complex problem." Explain.
   How to answer

   • Interpret statement about combinatorial explosion reducing efficiency
   • Explain complexity growth in complex problems
   • Explain need for heuristics, pruning, abstraction
   • Give gaming example e.g., search space
10. 7 Marks
    bExplain the differences between state machines and behavior trees with examples.
    How to answer

    • Define finite state machine with states and transitions
    • Define behavior tree with selector, sequence, leaf nodes
    • Compare on structure, scalability, reusability, design
    • Give game AI examples for each
11. 7 Marks
    aConstruct a finite state machine for the following data:

    1. i)If you don't see a thief, stand guard
    2. ii)While on guard, if you see a thief, fight him, but if he is strong, then flee
    3. iii)If you are fighting, if you know you are losing the fight, then flee
    4. iv)While fleeing, simply escape to the guarding state.
    How to answer

    • Identify states: stand guard, fight, flee
    • Define transitions based on see thief, strong, losing
    • Draw state diagram with labeled arrows
    • Verify all four given conditions covered
12. 7 Marks
    bDraw and explain a flowchart on average based fuzzy time series and Markov chain based on modified frequency partitioning.
    How to answer

    • Define average based fuzzy time series and Markov chain partitioning
    • Draw flowchart with fuzzification, frequency modification, transition matrix
    • Explain each block in forecasting steps
    • Mention use in game prediction
13. 7 Marks
    aSolve the following pay-off matrix:

    How to answer

    • Write given 2x3 pay-off matrix for Player A vs Player B
    • Check for saddle point / apply dominance or minimax principle
    • Compute value of game and optimal strategies
    • State solution with strategies and game value
14. 7 Marks
    bConsider penalty kicks in a soccer match with payoffs represented by following table. Find the equilibrium.

    How to answer

    • Write given 2x2 penalty kick payoff table for Kicker/Goalie Left/Right
    • Check best responses and identify Nash equilibrium
    • Explain mixed vs pure strategy reasoning
    • State equilibrium outcome
15. 14 Marks
    Write a short note on any two of the following:

    1. a)Model of Game AI
    2. b)Stages of Motor Learning
    3. c)Decision Trees For Game Development
    4. d)Board Game Theory
    How to answer

    • Select any two topics from four given options
    • Define each with key components and diagram/flow
    • Give gaming application example
    • Conclude with importance in game development