Game Balancing Theory Making a non-computer or computer game fair for players vs. player, or player vs. computer AdamCon 17 July 15, 2005 Dale Wick.

Slides:



Advertisements
Similar presentations
STRUCTURES & STRATAGIES PRINCIPLES OF PLACE
Advertisements

Team Offense: The 200 Set.
The Game of Science David P. Maloney & Mark F. Masters
Structures & Strategies. Tactics As part of your game plan, you will include the use of tactics. 'Tactics' are quite simply the variations of play used.
Lecture 12: Revision Lecture Dr John Levine Algorithms and Complexity March 27th 2006.
Section 3 CS182 Intelligent Machines: Reasoning, Actions and Plans.
Adversarial Search Chapter 5.
Application of Artificial intelligence to Chess Playing Capstone Design Project 2004 Jason Cook Bitboards  Bitboards are 64 bit unsigned integers, with.
The Implementation of Artificial Intelligence and Temporal Difference Learning Algorithms in a Computerized Chess Programme By James Mannion Computer Systems.
Artificial Intelligence for Games Game playing Patrick Olivier
Artificial Intelligence in Game Design Heuristics and Other Ideas in Board Games.
Search Strategies.  Tries – for word searchers, spell checking, spelling corrections  Digital Search Trees – for searching for frequent keys (in text,
10/19/2004TCSS435A Isabelle Bichindaritz1 Game and Tree Searching.
Games CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
A Research Agenda for Scholastic Chess Fernand Gobet Department of Psychological Sciences.
Algorithms & Computer Chess A presentation by Zachary Fiskin Christopher Cruzen.
Chess AI’s, How do they work? Math Club 10/03/2011.
Module 3 Chess 101 Strategy Strategy refers to an overall plan to achieve a goal In every game you play your goal should be to checkmate your opponent,
Artificial Intelligence in Game Design Introduction to Learning.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.6: Adversarial Search Fall 2008 Marco Valtorta.
Shallow Blue Project 2 Due date: April 5 th. Introduction Second in series of three projects This project focuses on getting AI opponent Subsequent project.
A TIE IS NOT A LOSS Paul Adamiak T02 Aruna Meiyeppen T01.
MAE 552 – Heuristic Optimization Lecture 28 April 5, 2002 Topic:Chess Programs Utilizing Tree Searches.
Online Chess Project 3 Due date: April 17 th. Introduction Third in series of three projects This project focuses on adding online support –2 players.
4th year Dance Tactics Theory Lesson 3.
Games & Adversarial Search Chapter 6 Section 1 – 4.
The Elements of Gameplay by Richard Rouse III Ayşegül Bakar.
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,
Cryptography Week-6.
HIGHER/INTERMEDIATE 2 PE  Basketball Structures and Strategies.
CISC 235: Topic 6 Game Trees.
9/14/20151 Game Theory and Game Balance CIS 487/587 Bruce R. Maxim UM-Dearborn.
1 State Space of a Problem Lecture 03 ITS033 – Programming & Algorithms Asst. Prof.
Upper Confidence Trees for Game AI Chahine Koleejan.
Othello Artificial Intelligence With Machine Learning
Starcraft Opponent Modeling CSE 391: Intro to AI Luciano Cheng.
Instructor: Vincent Conitzer
Game Playing. Towards Intelligence? Many researchers attacked “intelligent behavior” by looking to strategy games involving deep thought. Many researchers.
Application of Artificial Intelligence to Chess Playing Jason Cook Capstone Project.
Public Policy Analysis MPA 404 Lecture 24. Previous Lecture Graphical Analysis of Tariff and Quota Game Theory; The prisoner's Dilemma.
Games. Adversaries Consider the process of reasoning when an adversary is trying to defeat our efforts In game playing situations one searches down the.
CSC Intro. to Computing Lecture 22: Artificial Intelligence.
Tactics. What is a tactic? A tactic is a specific way of carrying out a particular strategy and of applying in action principles of play common in games.
I Robot.
Tactics. A game plan/strategy/formation/system of play made up before/during a game to increase chance of success/take advantage of strengths/limit weaknesses/limit.
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.
Backtracking and Games Eric Roberts CS 106B January 28, 2013.
CSCI 4310 Lecture 6: Adversarial Tree Search. Book Winston Chapter 6.
Adversarial Search Chapter Games vs. search problems "Unpredictable" opponent  specifying a move for every possible opponent reply Time limits.
Artificial Intelligence and Searching CPSC 315 – Programming Studio Spring 2013 Project 2, Lecture 1 Adapted from slides of Yoonsuck Choe.
Social Factors. Team dynamics Communication Cooperating Contributing to a team Relationships BBC Bitesize Clip on the Team
Quoridor and Artificial Intelligence
Chess Strategies Component Skills Strategies Prototype Josh Waters, Ty Fenn, Tianyu Chen.
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.
The Implementation of Artificial Intelligence and Temporal Difference Learning Algorithms in a Computerized Chess Program By James Mannion Computer Systems.
Othello Artificial Intelligence With Machine Learning Computer Systems TJHSST Nick Sidawy.
Adversarial Search Chapter 6 Section 1 – 4. Games vs. search problems "Unpredictable" opponent  specifying a move for every possible opponent reply Time.
Concepts, Drills & Strategies to develop an effective Woman-up Offense Gregg Gebhard Head Coach Saint Francis University.
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.
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.
Artificial Intelligence AIMA §5: Adversarial Search
Symmetry in Board and Video Games
Multiplayer Games By: Miss Dinnella.
Artificial Intelligence
Alpha-Beta Search.
Artificial Intelligence
Alpha-Beta Search.
Alpha-Beta Search.
Alpha-Beta Search.
Alpha-Beta Search.
Presentation transcript:

Game Balancing Theory Making a non-computer or computer game fair for players vs. player, or player vs. computer AdamCon 17 July 15, 2005 Dale Wick

Game Balancing Theory ● Player vs. Player games establishes a relationship between the players which the player tries to exploit. ● There are four basic strategies for balancing p vs.p games – Symmetric relationship – Asymmetric relationship – Triangularity – Actors and indirection

Game Balancing Theory ● Symmetric relationship – The simplest architecture with each player with identical strengths and weaknesses. (One on one basketball, Rocky) – This type of game is automatically balanced. – Suffers from a relative simplicity ● Any successful strategy for one side can be used by both sides ● Success is derived from execution, not strategy ● Or success is derived from fine details (a pawn in Chess)

Game Balancing Theory ● Asymmetric relationship – Each player has unique advantages and disadvantages. – Must balance both sides to have same likely-hood of victory, given equal levels of skills – A simple way to do this via plastic asymmetry, with an initially symmetric conditions, which are customized with a set of initial traits according to some set of restrictions.

Game Balancing Theory ● Triangularity – Non-transitive or triangular relationship – For example Rock-Paper-Scissors ● Pure triangulary does not provide that much interest ● Most often implemented as a combination of offensive and defensive strengths/weaknesses

Game Balancing Theory ● Actors and Indirect Relationships – Actors are computer controlled characters. – Indirection is where the player gives the actor a set of instructions and the actor engages in direct battle. ● The disadvantage is that the player is left to watch the battle, instead of being directly engages ● Works well with complex scenario where there is a large number of actors involved.

Game Balancing Theory ● Player vs. computer games pits two very different types of opponents against each other. ● The thought processes of a human player is “diffuse, associative and integrated” ● The thought processes of the computer is “direct, linear and arithmetic”

Game Balancing Theory ● Creating a game that a human would enjoy, puts the computer at a disadvantage. ● Imaging the following game: – Count all of the numbers from 1 to 1,000,000 ● Easy for the computer, tedious for the human. ● Imagine the game: minesweeper – Interesting and easy enough for the human, tricky for a computer to play. As a result the human can play easier.

Game Balancing Theory ● There are four strategies to balance p vs. c games. – Vast resources – Artificial “smarts” – Limited information – Pace

Game Balancing Theory ● Vast resources – Computer is provided vast resources which it uses stupidly – The computer uses many opponents with rudimentary intelligence (Slither, Defender, Space Fury, etc.) – Or the computer uses a one or a few really powerful opponents with rudimentary intelligence. (Zaxon, Donkey Kong, Mouse Trap) ● Gives a David vs. Goliath air ● Easy to implement.

Game Balancing Theory ● Artificial smarts – Cheaper than the moving mark of fully “Artificial Intelligence” (Trolls Tale, Destructor, Chess, etc.) – Must produce reasonable behavior in every situation – Be unpredictable ● Moves should be created based upon context and other player's moves ● Must use C&O algorithms to compute the next move in a reasonable amount of time – Combinatorics and Optimization: spatial algorithms like shortest path, decision trees pruning like alpha/beta searching, etc.

Game Balancing Theory ● Limited Information – If the human player doesn't have the information, then he cannot apply his superior reasoning to the situation (Antarctic Adventure, Turbo, etc.) – If applied to excess it turns the game into a game of chance ● Tickles the imagination of the player – Random gaps in information will be confusing, so the hidden information must be artfully chosen

Game Balancing Theory ● Pace – The human may be smart, but the computer is fast at doing simple computations. (Tetris, Adictus, etc.) ● This technique is very easy to use, but has the disadvantage that it limits the player's involvement in an immersive experience

Game Balancing Theory ● Further reading: “The Art of Computer Game Design” by Chris Crawford, 1982 – Available as a PDF from Washington State University at Vancouver (WSUV) transcribed by Sue Peabody, department of History