CS 4730 Game Balancing CS 4730 – Computer Game Design Credit: Some slide material courtesy Walker White (Cornell)

Slides:



Advertisements
Similar presentations
Adversarial Search Chapter 6 Sections 1 – 4. Outline Optimal decisions α-β pruning Imperfect, real-time decisions.
Advertisements

Heuristic Search techniques
Adversarial Search Chapter 6 Section 1 – 4. Types of Games.
Gallup Q12 Definitions Notes to Managers
Nash’s Theorem Theorem (Nash, 1951): Every finite game (finite number of players, finite number of pure strategies) has at least one mixed-strategy Nash.
Imbalanced data David Kauchak CS 451 – Fall 2013.
CS 4730 Defining Formal Elements CS 4730 – Computer Game Design.
Games & Adversarial Search Chapter 5. Games vs. search problems "Unpredictable" opponent  specifying a move for every possible opponent’s reply. Time.
Adversarial Search: Game Playing Reading: Chapter next time.
Part 3: The Minimax Theorem
Minimax and Alpha-Beta Reduction Borrows from Spring 2006 CS 440 Lecture Slides.
Swami NatarajanJune 17, 2015 RIT Software Engineering Reliability Engineering.
Evolutionary Games The solution concepts that we have discussed in some detail include strategically dominant solutions equilibrium solutions Pareto optimal.
Introduction to Virtual Reality Mark Green School of Creative Media.
Evolutionary Games The solution concepts that we have discussed in some detail include strategically dominant solutions equilibrium solutions Pareto optimal.
Alpha-Beta Search. 2 Two-player games The object of a search is to find a path from the starting position to a goal position In a puzzle-type problem,
CS Reinforcement Learning1 Reinforcement Learning Variation on Supervised Learning Exact target outputs are not given Some variation of reward is.
Playing for Life – what is it? Playing for life is an approach to coaching that uses games rather than drills to introduce the skills and tactics of the.
CS 4730 Level Design CS 4730 – Computer Game Design Credit: Several slides from Walker White (Cornell)
Game Trees: MiniMax strategy, Tree Evaluation, Pruning, Utility evaluation Adapted from slides of Yoonsuck Choe.
Minimax Trees: Utility Evaluation, Tree Evaluation, Pruning CPSC 315 – Programming Studio Spring 2008 Project 2, Lecture 2 Adapted from slides of Yoonsuck.
Brian Duddy.  Two players, X and Y, are playing a card game- goal is to find optimal strategy for X  X has red ace (A), black ace (A), and red two (2)
9/14/20151 Game Theory and Game Balance CIS 487/587 Bruce R. Maxim UM-Dearborn.
Game Playing Chapter 5. Game playing §Search applied to a problem against an adversary l some actions are not under the control of the problem-solver.
Sporting Spirit Values Statements for Players, Coaching & Volunteering roles, Primary Level and Whole School.
Game Playing Chapter 5. Game playing §Search applied to a problem against an adversary l some actions are not under the control of the problem-solver.
Games as Game Theory Systems (Ch. 19). Game Theory It is not a theoretical approach to games Game theory is the mathematical study of decision making.
Dynamic Games of complete information: Backward Induction and Subgame perfection - Repeated Games -
Standard and Extended Form Games A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor, SIUC.
CS 4730 Action vs. Interaction CS 4730 – Computer Game Design Credit: Several slides from Walker White (Cornell)
Game Theory Part 2: Zero Sum Games. Zero Sum Games The following matrix defines a zero-sum game. Notice the sum of the payoffs to each player, at every.
CS 4730 Game Balancing CS 4730 – Computer Game Design Credit: Some slide material courtesy Walker White (Cornell)
Houens Odde, Denmark PROGRAMME DEVELOPERS SUMMIT.
Instructor: Vincent Conitzer
Travel Soccer Berlin Youth Soccer Association Traveling – how much and how far? How much? Half of your games are in Berlin (one or two a week). All your.
CS 4730 Probability and Risk CS 4730 – Computer Game Design Credit: Several slides from Walker White (Cornell)
Games. Adversaries Consider the process of reasoning when an adversary is trying to defeat our efforts In game playing situations one searches down the.
Monte-Carlo methods for Computation and Optimization Spring 2015 Based on “N-Grams and the Last-Good-Reply Policy Applied in General Game Playing” (Mandy.
What is ALEKS? Who uses ALEKS? How is ALEKS being used? Teacher Feedback Recommendations.
Probability Evaluation 11/12 th Grade Statistics Fair Games Random Number Generator Probable Outcomes Resources Why Fair Games? Probable Outcome Examples.
Adversarial Search Chapter Games vs. search problems "Unpredictable" opponent  specifying a move for every possible opponent reply Time limits.
Warm Up If Babe Ruth has a 57% chance of hitting a home run every time he is at bat, run a simulation to find out his chances of hitting a homerun at least.
Types and Methods of Practice.
KEYS Scott Gajewski ART 389A Spring Contents Premise Getting Started -Players -Set-up -Materials Rules -Basics -Points System -Multiple Players.
Psychology of Physical Education and Sport. Couple of Terms Cognition: Information processing Motor Control: Movement regulated by the nervous system.
CSE4AT3 Design Balancing Continued……………………………… …………………………………………..
Leadership & Team Work. Team Cohesion An effective team has cohesion, the team members work well together and share similar goals Cohesion is influenced.
GamblingGambling What are the odds? Jessica Judd.
Game tree search Chapter 6 (6.1 to 6.3 and 6.6) cover games. 6.6 covers state of the art game players in particular. 6.5 covers games that involve uncertainty.
ARTIFICIAL INTELLIGENCE (CS 461D) Princess Nora University Faculty of Computer & Information Systems.
Statistics Overview of games 2 player games representations 2 player zero-sum games Render/Stair/Hanna text CD QM for Windows software Modeling.
Approaches Workbook Conditioned Games – Teacher Answers.
An AI Game Project. Background Fivel is a unique hybrid of a NxM game and a sliding puzzle. The goals in making this project were: Create an original.
Explorations in Artificial Intelligence Prof. Carla P. Gomes Module 5 Adversarial Search (Thanks Meinolf Sellman!)
Welcome. Common Core State Standards? English Language Arts and Literacy in History/Social Studies, Science, and Technical Subjects Mathematical Practice.
Understanding AI of 2 Player Games. Motivation Not much experience in AI (first AI project) and no specific interests/passion that I wanted to explore.
FRISBEE GOLF. you will need at least one Frisbee and one player How to Play Frisbee Golf Step #1.
What is a CAT? What is a CAT?.
Games with Chance Other Search Algorithms
Chapter 8: Selecting an appropriate price level
Announcements Homework 3 due today (grace period through Friday)
Difficulty Modes and DDA Flow in Games Difficulty and Reward
CIS 487/587 Bruce R. Maxim UM-Dearborn
Instructor: Vincent Conitzer
Minimax strategies, alpha beta pruning
Difficulty Modes and DDA Flow in Games Difficulty and Reward
Minimax strategies, alpha beta pruning
CS51A David Kauchak Spring 2019
Presentation transcript:

CS 4730 Game Balancing CS 4730 – Computer Game Design Credit: Some slide material courtesy Walker White (Cornell)

CS 4730 Dungeons and Dragons D&D is a fantasy roll playing system Dungeon Masters run (and sometimes create) campaigns for players to experience These campaigns have several aspects –Roll playing –Skill challenges –Encounters We will look at some simple balancing of these aspects 2

CS 4730 Probabilities of D&D Skill Challenge Example: The player characters (PCs) have come upon a long wall that encompasses a compound they are trying to enter The wall is 20 feet tall and 1 foot thick What are some ways to overcome the wall? How hard should it be for the PCs to overcome the wall? 3

CS 4730 Probabilities of D&D How hard should it be for the PCs to overcome the wall? We approximate this in the game world using a Difficulty Class (DC) 4

CS 4730 Probabilities of D&D Easy – not trivial, but simple; reasonable challenge for untrained character Medium – requires training, ability, or luck Hard – designed to test characters focused on a skill 5

CS 4730 Balancing Balancing a game is can be quite the black art A typical player playing a game involves intuition, fantasy, and luck – it’s qualitative A game designer playing a game… it’s quantitative –They see the systems behind the game and this can actually “ruin” the game a bit 6

CS 4730 Building Balance General advice –Build a game for creativity’s sake first –Build a game for particular mechanics –Build a game for particular aesthetics Then, after all that… –Then balance –Complexity can be added and removed if needed –Other levers can be pulled Complexity vs. Depth 7

CS 4730 What makes a game balanced? When evaluating a game for balance, we typically look at three aspects: –Fairness –Stability –Engagement 8

CS 4730 Fairness A game is considered fair if each of an evenly matched group of players has an a priori equal chance of winning for any given starting position In a normal fair game for two players, each player should win about 50% of the time with both players playing at the same level 9

CS 4730 Fairness What does it mean for two players to be equally matched? 10

CS 4730 Fairness What does it mean for two players to be equally matched? –Similar heuristics –Ability to search the outcome tree the same distance ahead –Knowledge of probabilities 11

CS 4730 What’s the Probability of Winning? Consider older games Consider modern games What’s the probability of winning? How does save games affect this probability? 12

CS 4730 The “Going First” Problem A traditional problem in fairness is the “who goes first” problem Assume you have a game in which the player that goes first wins 2/3 of the time How would you fix this problem? 13

CS 4730 The “Going First” Problem Rotate who goes first –Who lost last game? –Randomize –Age / skill Disadvantaged player gets some extra resources Reduce effectiveness of the first turn –Limited move set 14

CS 4730 Balancing a One Player Game Changing the difficulty of the game over time is called pacing How do we measure difficulty? What’s the difference in scale vs. kind for pacing? 15

CS 4730 Reinforcing Behaviors As players do things in games, we want to either reinforce or punish certain behaviors to establish appropriate balance and pacing Positive feedback encourages a behavior to be repeated in the future Negative feedback discourages a behavior to be repeated in the future Adjusting feedback adjusts the game balance 16

CS 4730 Reinforcing Behaviors Consider basketball –When you scores, the other team gets the ball –This is negative feedback –We don’t want a team to be able to get ahead too quickly Consider Mario Kart –When you’re in the lead, you get crappy items –This is negative feedback –Rubber-banding is also negative feedback 17

CS 4730 Reinforcing Behaviors Consider RPGs –If you use a sword a lot, it might level up –Leveling up a sword makes it hit harder or more accurately –If the sword is better than the axe, you’ll use it more –This is positive feedback 18

CS 4730 Perfect Imbalance But what happens if that sword gets too powerful? What does in mean to have “perfect imbalance” in a game? How does it affect the way we look at and adjust the systems in our games? 19

CS 4730 Balancing For Skill Some actions/verbs of high power can (and should) have low skill requirements However, the progression should promote increasing skill to then move to other actions with power First Order Optimal strategies in gaming 20

CS 4730 Reinforcing Behaviors Both types of feedback have their own place in games We use different feedbacks to move players along or to increase challenge 21

CS 4730 Stability A game is considered stable if: –Feedback is negative at the opening, slightly positive at midgame, and very positive at endgame –It has multiple viable strategies to win (called stable Nash equilibria) 22

CS 4730 Stability Curve 23

CS 4730 Curve of Progression 24

CS 4730 No Feedback Provided 25

CS 4730 Curve of Progression 26

CS 4730 Too Little Positive Feedback 27

CS 4730 Curve of Progression 28

CS 4730 Too Much Positive Feedback 29

CS 4730 Curve of Progression 30

CS 4730 Powerful Negative Feedback 31

CS 4730 Curve of Progression 32

CS 4730 Ideal Game Progression 33

CS 4730 Multiple Strategies For good balance (and for engagement), there should be multiple ways to reach the win condition –Doesn’t necessarily mean there needs to be multiple win states, but that can be done as well We can mathematically reason about winning outcomes Def of “utility” = anything used to measure progress toward victory 34

CS 4730 Multiple Strategies Player optimal outcome - my utility is as high as possible Pareto optimal outcome - my utility cannot increase without decreasing another player's Equitable outcome - everyone's utility is the same and as high as it can be Efficient outcome - the sum of everyone's utility is as high as it can be Nash optimal outcome - my utility is as high as it can be, given other players played to their own interests 35

CS 4730 Multiple Outcomes Some of these outcomes are not necessarily feasible for all games Some require at least one player to play to lose Nash optimal is the most common as it assumes all players are playing to win and your ability to win is limited by how well others play (to some degree) 36

CS 4730 Thinking Down the Tree

CS 4730 Thinking Down the Tree When players play this game, they use a minimax algorithm working backward from the optimal outcomes for their goal This is a zero-sum game, where one score affects the other The only real outcome here is a tie if players are playing rationally Thus the game is not balanced because there is only one possible outcome 38

CS 4730 But who plays to win? Really! Who plays a game to win? In a 4 person game, your odds of winning are terrible Do you play a game if you know you’re going to win every time? 39

CS 4730 But who plays to win? You play a game for the experience! Games that are unfair or unstable are not engaging Can you think of some examples? 40

CS 4730 Going with the… Once you establish fairness and balance, you need to establish game flow Flow is technically a state of mind recognized by psychologists –A challenging activity that requires skill and concentration with a well-defined goal and direct responses –Merging action and awareness that increases self- confidence and a loss of self-consciousness (and sense of time) 41

CS 4730 Going with the… Pattern recognition helps with this We see repeated patterns all the time in games It allows us to enter that flow state of mind 42

CS 4730 Other Parts of Engagement Adversity – things to overcome Desire – the want of something Empowerment – enforcing one’s will Value – something that has meaning Drama – fantasy and storytelling Randomness – relieves the player from having to go too far down the decision tree (try to avoid “analysis paralysis”) 43

CS 4730 Differences in Scale vs. Kind Why does this matter? How does this play into engagement? 44

CS 4730 Optimizing for Real People Everyone playing to win is good… … but “successful” play must merge with “enjoyable” play Camping is a great strategy –But it can be boring –And it can really piss off other people 45

CS 4730 Optimizing for Real People We want the strategies that lead to a player winning to also be strategies that result in all players being entertained and achieving social harmony If both players camp in an FPS, this is technically a player optimal outcome but it really isn’t fun A Pareto outcome here (both non-camp) is more optimal 46

CS 4730 Optimizing for Real People Thus, we need to decrease the utility of camping to increase the likelihood of non- camping How are you balancing your game? 47