CS/INFO 4154: Analytics-driven Game Design
|
|
|
- Melvin Higgins
- 5 years ago
- Views:
Transcription
1 CS/INFO 4154: Analytics-driven Game Design Class 22: Balance
2 Mon Wed Fri 10/17 Interesting Decisions 10/19 Friends Release by 10:10am: Upload to CMS 10/22 Friends Release 10/24 Friends Release 10/26 Friends Release by 2pm: Friends Release Report
3 Friends Release Address feedback from Beta ~12 levels (or equivalent) Tutorials Music Sound effects Logging Privacy policy: In order to make improvements and provide the best possible experience, this game anonymously records user interactions and IP addresses and uses a cookie to track returns.
4 Problem with many games
5 Review: interesting decisions a game is a series of interesting decisions Sid Meier (GDC 2012)
6 Today: when are decisions interesting?
7 Outline Interestingness Decision spaces Balancing activity
8 Outline Interestingness Decision spaces Balancing activity
9 Interesting decisions Interesting decisions
10 Review: Difficulty
11 Difficulty Interesting decisions
12 Review: Incentives
13 Incentives Difficulty Interesting decisions
14
15 Conjoined Triangles of Success Incentives Difficulty Interesting decisions Balance
16 What is balance? Zerg OP, Toss imba!! So can we nerf terran now? - rockman StarCraft 2 Battle.net forums, 11/2013
17 What is balance? Narrowest sense: Fairness
18 Fair but not interesting
19 Interesting but not fair 52-56% Source: Wikipedia
20 What is balance? Narrowest sense: Fairness Expanded sense: Depth Variedness Interestingness A set of desirable characteristics about the decision space of the game
21 Years of Balancing
22 Halo 3 Balance Interface Pistol: Sniper Rifle: 3 4
23 Why is balance so hard? Games are complex interconnected systems A small change to one part affects other parts
24 Famous Balance Bug: Civilization Overly Aggressive Gandhi
25 5 minutes: pair activity Pick your favorite game Discuss: What are the decisions you must make in the game? Why are these decisions interesting? What characteristics does a game need to have for the space of decisions to be interesting?
26 Outline Interestingness Decision spaces Balancing activity
27 Outline Interestingness Decision spaces Balancing activity
28 Goal Describe a perspective on decision interestingness Set of criteria you can use to improve your game
29 Review: State Transition Diagram Win! Start Lose
30 Decision Trees now A B C move
31 Problem? now A move
32 Key Questions Are there decisions?
33 Are there decisions? Direkt, 2017
34 Problem? now A B C move
35 Key Questions Are there decisions? Does it matter what the player does?
36 Example: Permafrost, 2017
37 Problem? now move tower type A B C
38 Multiple situations now A B C A B C A B C move Situation 1 Situation 2 Situation 3
39 Problem? now A B C A B C A B C move Situation 1 Situation 2 Situation 3
40 Key Questions Are there decisions? Does it matter what the player does? Is there a strategy that always wins?
41 Example: Arc Shield, 2017
42 Problem? don t shoot shoot don t shoot shoot don t shoot shoot Situation 1 Situation 2 Situation 3
43 Halo 1
44 Halo 1: Overpowered Pistol
45 Problem? now A B C A B C A B C move Situation 1 Situation 2 Situation 3
46 Key Questions Are there decisions? Does it matter what the player does? Is there an action that always wins? Is some action always useless?
47 Ok if sometimes useless now A B C A B C A B C move Situation 1 Situation 2 Situation 3
48 Problem? Now move move
49 Key Questions Are there decisions? Does it matter what the player does? Is there an action that always wins? Is some action always useless? Is the outcome known long before the game s end?
50 Hiding outcome now move move move Interesting things need to be happening deep in the tree
51 Key Questions Are there decisions? Does it matter what the player does? Is there an action that always wins? Is some action always useless? Is the outcome known long before the game s end?
52 How can you measure balance? Diversity of actions and strategies chosen Overall success rate of actions and strategies
53 StarCraft II
54 StarCraft II
55 League of Legends
56 Outline Interestingness Decision spaces Balancing activity
57 Outline Interestingness Decision spaces Balancing activity
58 Tic-Tac-Toe Fun as a kid Not so much as an adult Why?
59 Pair Activity: fix tic-tac-toe Make it interesting Modify the game rules Consider the questions described earlier Inspired by Eric Zimmerman
60 Outline Interestingness Decision spaces Balancing activity
61 Outline Interestingness Decision spaces Balancing activity
62 Summary: interesting decisions Incentives Difficulty Interesting decisions Balance
CS/INFO 4154: Analytics-driven Game Design
CS/INFO 4154: Analytics-driven Game Design Class 19: Data Analysis and Visualization Mon Wed Fri 10/6 Data Visualization FALL BREAK! 10/11 10/13 Beta Playtesting 1 10/16 Beta Playtesting 2 10/18 Beta Playtesting
CS/INFO 4154: Analytics-driven Game Design
CS/INFO 4154: Analytics-driven Game Design Class 29: Who Pays for Games? by 2pm: Newgrounds Release Report Mon Wed Fri 11/2 Who Pays for Games? 11/5 Pokémon GO 11/7 Minecraft? 11/9 Newgrounds Release by
CS/INFO 4154: Analytics-driven Game Design
CS/INFO 4154: Analytics-driven Game Design Class 26: Ubiquitous Gaming Mon Wed Fri 10/25 Ubiquitous Gaming 10/27 Friends Release 1 10/30 Friends Release 2 11/1 Friends Release 3 11/3 Friends Release Report
CS/INFO 4154: Analytics-driven Game Design
CS/INFO 4154: Analytics-driven Game Design Class 14: Difficulty Mon Wed Fri 9/26 Difficulty 9/28 Incentive Structures Today @ 11:59pm: Alpha Report 10/1 Internet Telemetry 10/3 Beta Testing 1 10/5 Beta
Game Playing AI. Dr. Baldassano Yu s Elite Education
Game Playing AI Dr. Baldassano chrisb@princeton.edu Yu s Elite Education Last 2 weeks recap: Graphs Graphs represent pairwise relationships Directed/undirected, weighted/unweights Common algorithms: Shortest
Math 152: Applicable Mathematics and Computing
Math 152: Applicable Mathematics and Computing April 16, 2017 April 16, 2017 1 / 17 Announcements Please bring a blue book for the midterm on Friday. Some students will be taking the exam in Center 201,
CS/INFO 4154: Analytics-driven Game Design
CS/INFO 4154: Analytics-driven Game Design Class 31: Revenue, Part 2 Mon Wed Fri 11/7 Revenue, Part 2 11/9 Newgrounds Release 1 by 10:10am: Upload Game to CMS 11/12 Newgrounds Release 2 11/14 Newgrounds
Artificial Intelligence
Artificial Intelligence CS482, CS682, MW 1 2:15, SEM 201, MS 227 Prerequisites: 302, 365 Instructor: Sushil Louis, sushil@cse.unr.edu, http://www.cse.unr.edu/~sushil Games and game trees Multi-agent systems
2359 (i.e. 11:59:00 pm) on 4/16/18 via Blackboard
CS 109: Introduction to Computer Science Goodney Spring 2018 Homework Assignment 4 Assigned: 4/2/18 via Blackboard Due: 2359 (i.e. 11:59:00 pm) on 4/16/18 via Blackboard Notes: a. This is the fourth homework
CS885 Reinforcement Learning Lecture 13c: June 13, Adversarial Search [RusNor] Sec
![CS885 Reinforcement Learning Lecture 13c: June 13, Adversarial Search [RusNor] Sec](/thumbs/89/98879037.jpg "CS885 Reinforcement Learning Lecture 13c: June 13, Adversarial Search [RusNor] Sec")
CS885 Reinforcement Learning Lecture 13c: June 13, 2018 Adversarial Search [RusNor] Sec. 5.1-5.4 CS885 Spring 2018 Pascal Poupart 1 Outline Minimax search Evaluation functions Alpha-beta pruning CS885
game tree complete all possible moves
Game Trees Game Tree A game tree is a tree the nodes of which are positions in a game and edges are moves. The complete game tree for a game is the game tree starting at the initial position and containing
Chapter 2. Emergence and Progression
Chapter 2 Emergence and Progression In this chapter, we explore this important distinction in more detail and provide examples of each category. We also explore the structural differences in the mechanics
ARTIFICIAL INTELLIGENCE (CS 370D)
Princess Nora University Faculty of Computer & Information Systems ARTIFICIAL INTELLIGENCE (CS 370D) (CHAPTER-5) ADVERSARIAL SEARCH ADVERSARIAL SEARCH Optimal decisions Min algorithm α-β pruning Imperfect,
CS 331: Artificial Intelligence Adversarial Search II. Outline
CS 331: Artificial Intelligence Adversarial Search II 1 Outline 1. Evaluation Functions 2. State-of-the-art game playing programs 3. 2 player zero-sum finite stochastic games of perfect information 2 1
Second version (March 2014) by Telenil
Second version (March 2014) by Telenil This document is a step-by-step installation guide for the Starcraft 1 and Brood War campaigns remake, with all necessary links and screenshots. The process does
2 person perfect information
Why Study Games? Games offer: Intellectual Engagement Abstraction Representability Performance Measure Not all games are suitable for AI research. We will restrict ourselves to 2 person perfect information
Lecture 33: How can computation Win games against you? Chess: Mechanical Turk
4/2/0 CS 202 Introduction to Computation " UNIVERSITY of WISCONSIN-MADISON Computer Sciences Department Lecture 33: How can computation Win games against you? Professor Andrea Arpaci-Dusseau Spring 200
Playing Games. Henry Z. Lo. June 23, We consider writing AI to play games with the following properties:
Playing Games Henry Z. Lo June 23, 2014 1 Games We consider writing AI to play games with the following properties: Two players. Determinism: no chance is involved; game state based purely on decisions
Game Playing AI Class 8 Ch , 5.4.1, 5.5
Game Playing AI Class Ch. 5.-5., 5.4., 5.5 Bookkeeping HW Due 0/, :59pm Remaining CSP questions? Cynthia Matuszek CMSC 6 Based on slides by Marie desjardin, Francisco Iacobelli Today s Class Clear criteria
Automatic Game Balancing
Automatic Game Balancing Vanessa Volz 12/04/2016 Vanessa Volz (TU Dortmund) Automatic Game Balancing 12/04/2016 1 / 12 Table of Contents 1 Motivational Examples 2 Game Balancing Framework 3 Outlook Vanessa
CS 2710 Foundations of AI. Lecture 9. Adversarial search. CS 2710 Foundations of AI. Game search
CS 2710 Foundations of AI Lecture 9 Adversarial search Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square CS 2710 Foundations of AI Game search Game-playing programs developed by AI researchers since
Module 3. Problem Solving using Search- (Two agent) Version 2 CSE IIT, Kharagpur
Module 3 Problem Solving using Search- (Two agent) 3.1 Instructional Objective The students should understand the formulation of multi-agent search and in detail two-agent search. Students should b familiar
SWEET LOGIC SINGLE PLAYER AGES 8 TO ADULT
SWEET LOGIC STEM BRAINTEASER PUZZLE INSTRUCTION MANUAL SINGLE PLAYER AGES 8 TO ADULT When all nine chocolate pieces are in the tray, flip the page over to see if you have correctly filled the customer
Math Games Ideas. For School or Home Education. by Teresa Evans. Copyright 2005 Teresa Evans. All rights reserved.
Math Games Ideas For School or Home Education by Teresa Evans Copyright 2005 Teresa Evans. All rights reserved. Permission is given for the making of copies for use in the home or classroom of the purchaser
Grade 7/8 Math Circles November 24/25, Review What have you learned in the past seven weeks?
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles November 24/25, 2015 Review What have you learned in the past seven weeks? First
Announcements. Homework 1 solutions posted. Test in 2 weeks (27 th ) -Covers up to and including HW2 (informed search)
Minimax (Ch. 5-5.3) Announcements Homework 1 solutions posted Test in 2 weeks (27 th ) -Covers up to and including HW2 (informed search) Single-agent So far we have look at how a single agent can search
The Mathematics of Playing Tic Tac Toe
The Mathematics of Playing Tic Tac Toe by David Pleacher Although it has been shown that no one can ever win at Tic Tac Toe unless a player commits an error, the game still seems to have a universal appeal.
Tutorial 1. (ii) There are finite many possible positions. (iii) The players take turns to make moves.
1 Tutorial 1 1. Combinatorial games. Recall that a game is called a combinatorial game if it satisfies the following axioms. (i) There are 2 players. (ii) There are finite many possible positions. (iii)
Adversarial Search and Game Playing. Russell and Norvig: Chapter 5
Adversarial Search and Game Playing Russell and Norvig: Chapter 5 Typical case 2-person game Players alternate moves Zero-sum: one player s loss is the other s gain Perfect information: both players have
Computer Science and Software Engineering University of Wisconsin - Platteville. 4. Game Play. CS 3030 Lecture Notes Yan Shi UW-Platteville
Computer Science and Software Engineering University of Wisconsin - Platteville 4. Game Play CS 3030 Lecture Notes Yan Shi UW-Platteville Read: Textbook Chapter 6 What kind of games? 2-player games Zero-sum
CS 1571 Introduction to AI Lecture 12. Adversarial search. CS 1571 Intro to AI. Announcements
CS 171 Introduction to AI Lecture 1 Adversarial search Milos Hauskrecht milos@cs.pitt.edu 39 Sennott Square Announcements Homework assignment is out Programming and experiments Simulated annealing + Genetic
V. Adamchik Data Structures. Game Trees. Lecture 1. Apr. 05, Plan: 1. Introduction. 2. Game of NIM. 3. Minimax
Game Trees Lecture 1 Apr. 05, 2005 Plan: 1. Introduction 2. Game of NIM 3. Minimax V. Adamchik 2 ü Introduction The search problems we have studied so far assume that the situation is not going to change.
Adversary Search. Ref: Chapter 5
Adversary Search Ref: Chapter 5 1 Games & A.I. Easy to measure success Easy to represent states Small number of operators Comparison against humans is possible. Many games can be modeled very easily, although
Grade 7/8 Math Circles November 24/25, Review What have you learned in the past seven weeks?
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles November 24/25, 2015 Review What have you learned in the past seven weeks? First
Adversarial Search (Game Playing)
Artificial Intelligence Adversarial Search (Game Playing) Chapter 5 Adapted from materials by Tim Finin, Marie desjardins, and Charles R. Dyer Outline Game playing State of the art and resources Framework
Artificial Intelligence
Artificial Intelligence CS482, CS682, MW 1 2:15, SEM 201, MS 227 Prerequisites: 302, 365 Instructor: Sushil Louis, sushil@cse.unr.edu, http://www.cse.unr.edu/~sushil Non-classical search - Path does not
Game-playing AIs: Games and Adversarial Search FINAL SET (w/ pruning study examples) AIMA
Game-playing AIs: Games and Adversarial Search FINAL SET (w/ pruning study examples) AIMA 5.1-5.2 Games: Outline of Unit Part I: Games as Search Motivation Game-playing AI successes Game Trees Evaluation
Presentation by Toy Designers: Max Ashley
A new game for your toy company Presentation by Toy Designers: Shawntee Max Ashley As game designers, we believe that the new game for your company should: Be equally likely, giving each player an equal
Let s Make Math Fun. Volume 20 March/April 2013
Let s Make Math Fun Volume 20 March/April 2013 Paper Plate Fractions It s Time for Bingo More Ways to Help Them Master Multiplication Printable Math Board Games Match and Flip Addition Puzzles THE LET
Game Variations: Ultimate Tic Tac Toe
Game Variations: Ultimate Tic Tac Toe Middle School In this lesson, students will experience the engineering process when creating modifications to a familiar game. Next Generation Science Standards MS-ETS1-1
mywbut.com Two agent games : alpha beta pruning
Two agent games : alpha beta pruning 1 3.5 Alpha-Beta Pruning ALPHA-BETA pruning is a method that reduces the number of nodes explored in Minimax strategy. It reduces the time required for the search and
Adversarial Search 1
Adversarial Search 1 Adversarial Search The ghosts trying to make pacman loose Can not come up with a giant program that plans to the end, because of the ghosts and their actions Goal: Eat lots of dots
by Teresa Evans Copyright 2005 Teresa Evans. All rights reserved.
by Teresa Evans Copyright 2005 Teresa Evans. All rights reserved. Permission is given for the making of copies for use in the home or classroom of the purchaser only. Making Math More Fun Math Games Ideas
Rules of the game. chess checkers tic-tac-toe...
Course 8 Games Rules of the game Two players: MAX and MIN Both have as goal to win the game Only one can win or else it will be a draw In the initial modeling there is no chance (but it can be simulated)
Board Game AIs. With a Focus on Othello. Julian Panetta March 3, 2010
Board Game AIs With a Focus on Othello Julian Panetta March 3, 2010 1 Practical Issues Bug fix for TimeoutException at player init Not an issue for everyone Download updated project files from CS2 course
Q: WHAT ARE THE RESIDENCY REQUIREMENTS FOR THOSE WHO PLAY TO COMPETE? A: This is event is restricted to UK and Ireland, therefore:
FAQ Q: HOW MANY GAMES WILL BE PLAYED TO DETERMINE THE WINNER OF EACH MATCH-UP? A: The tournament is a 5v5 Summoner s Rift sudden death (Best-of-one), and the finals will be Best-of-Three. Q: CAN I PARTICIPATE
CMPUT 396 Tic-Tac-Toe Game
CMPUT 396 Tic-Tac-Toe Game Recall minimax: - For a game tree, we find the root minimax from leaf values - With minimax we can always determine the score and can use a bottom-up approach Why use minimax?
CS 4700: Foundations of Artificial Intelligence
CS 4700: Foundations of Artificial Intelligence Bart Selman Reinforcement Learning R&N Chapter 21 Note: in the next two parts of RL, some of the figure/section numbers refer to an earlier edition of R&N
ADVERSARIAL SEARCH. Today. Reading. Goals. AIMA Chapter Read , Skim 5.7
ADVERSARIAL SEARCH Today Reading AIMA Chapter Read 5.1-5.5, Skim 5.7 Goals Introduce adversarial games Minimax as an optimal strategy Alpha-beta pruning 1 Adversarial Games People like games! Games are
Exploring Technology 8 th Grade Prof Crudele
Exploring Technology 8 th Grade Prof Crudele Exploring Technology is an introductory course covering many important topics and concepts in computer science. Students are evaluated as follows: 15% HW/CW,
CS 188: Artificial Intelligence Spring Announcements
CS 188: Artificial Intelligence Spring 2011 Lecture 7: Minimax and Alpha-Beta Search 2/9/2011 Pieter Abbeel UC Berkeley Many slides adapted from Dan Klein 1 Announcements W1 out and due Monday 4:59pm P2
Announcements. CS 188: Artificial Intelligence Spring Game Playing State-of-the-Art. Overview. Game Playing. GamesCrafters
CS 188: Artificial Intelligence Spring 2011 Announcements W1 out and due Monday 4:59pm P2 out and due next week Friday 4:59pm Lecture 7: Mini and Alpha-Beta Search 2/9/2011 Pieter Abbeel UC Berkeley Many
MOVING TO THRIVE: ACTIVITIES FOR AGES 10 TO 18 YEARS
WHO AM I One pack of post it notes, a timer, and a pen to write. Write down any famous characters or celebrities on a post it note. Stick the post it note on one person s forehead, making sure that everyone
LITTLE BITES TIC TAC TOE Pair two of your favorite classics- Little Bites and Tic Tac Toe- for a game that is bound to bring back happy memories!
LITTLE BITES TIC TAC TOE Pair two of your favorite classics- Little Bites and Tic Tac Toe- for a game that is bound to bring back happy memories! Tic Tac Toe Printable (Included in Party Kit) (2) packages
CS/INFO 4154: Brainstorming and Prototyping. Analytics-driven Game Design. Lecture 3: Epic s Epic Epic
CS/INFO 4154: Analytics-driven Game Design Lecture 3: Brainstorming and Prototyping Epic s Epic Epic Last time Game Mechanics Actions Interactions Thursday: Paper Prototyping Tuesday: More Paper Prototyping
INF September 25, The deadline is postponed to Tuesday, October 3
INF 4130 September 25, 2017 New deadline for mandatory assignment 1: The deadline is postponed to Tuesday, October 3 Today: In the hope that as many as possibble will turn up to the important lecture on
Game-playing AIs: Games and Adversarial Search I AIMA
Game-playing AIs: Games and Adversarial Search I AIMA 5.1-5.2 Games: Outline of Unit Part I: Games as Search Motivation Game-playing AI successes Game Trees Evaluation Functions Part II: Adversarial Search
AI Approaches to Ultimate Tic-Tac-Toe
AI Approaches to Ultimate Tic-Tac-Toe Eytan Lifshitz CS Department Hebrew University of Jerusalem, Israel David Tsurel CS Department Hebrew University of Jerusalem, Israel I. INTRODUCTION This report is
Lesson Lesson 3.7 ~ Theoretical Probability
Theoretical Probability Lesson.7 EXPLORE! sum of two number cubes Step : Copy and complete the chart below. It shows the possible outcomes of one number cube across the top, and a second down the left
Unit 12: Artificial Intelligence CS 101, Fall 2018
Unit 12: Artificial Intelligence CS 101, Fall 2018 Learning Objectives After completing this unit, you should be able to: Explain the difference between procedural and declarative knowledge. Describe the
CS 680: GAME AI INTRODUCTION TO GAME AI. 1/9/2012 Santiago Ontañón
CS 680: GAME AI INTRODUCTION TO GAME AI 1/9/2012 Santiago Ontañón santi@cs.drexel.edu https://www.cs.drexel.edu/~santi/teaching/2012/cs680/intro.html CS 680 Focus: advanced artificial intelligence techniques
Game Playing State of the Art
Game Playing State of the Art Checkers: Chinook ended 40 year reign of human world champion Marion Tinsley in 1994. Used an endgame database defining perfect play for all positions involving 8 or fewer
Caterpillar Chase. Race to the Finish. On the Ferris Wheel
Caterpillar Chase Objective: To practice basic addition facts Materials: For partners number cube (labeled ) p., red connecting cube, blue connecting cube, or other playing pieces Playing the Game: This
Build paper airplanes and have a flying contest
Build paper airplanes and have a flying contest Play hide and seek Compose your own song Do the limbo with a broom stick Build a brand new musical instrument Master the hula hoop Master the handstand for
Lesson 5: Understanding Subtraction of Integers and Other Rational Numbers
\ Lesson 5: Understanding Subtraction of Integers and Other Rational Numbers Student Outcomes Students justify the rule for subtraction: Subtracting a number is the same as adding its opposite. Students
ADVERSARIAL SEARCH. Today. Reading. Goals. AIMA Chapter , 5.7,5.8
ADVERSARIAL SEARCH Today Reading AIMA Chapter 5.1-5.5, 5.7,5.8 Goals Introduce adversarial games Minimax as an optimal strategy Alpha-beta pruning (Real-time decisions) 1 Questions to ask Were there any
Game Balance. Chris Ko and Jonathan Janosi
Game Balance Chris Ko and Jonathan Janosi A good game is a series of interesting choices. - Sid Meier Balancing Games 2 Major issues Fairness (PvE) Difficulty (PvP) What is a balanced game? Characteristics
Name. Is the game fair or not? Prove your answer with math. If the game is fair, play it 36 times and record the results.
Homework 5.1C You must complete table. Use math to decide if the game is fair or not. If Period the game is not fair, change the point system to make it fair. Game 1 Circle one: Fair or Not 2 six sided
Conversion Masters in IT (MIT) AI as Representation and Search. (Representation and Search Strategies) Lecture 002. Sandro Spina
Conversion Masters in IT (MIT) AI as Representation and Search (Representation and Search Strategies) Lecture 002 Sandro Spina Physical Symbol System Hypothesis Intelligent Activity is achieved through
Foundations of Interactive Game Design (80K) week one, lecture one
Foundations of Interactive Game Design (80K) week one, lecture one Introductions TAs, reader/tutors, faculty If you want to add this class As of today, four of seven sections had space most space in Tuesday
Foundations of Probability Worksheet Pascal
Foundations of Probability Worksheet Pascal The basis of probability theory can be traced back to a small set of major events that set the stage for the development of the field as a branch of mathematics.
Embedded Systems Lab
Embedded Systems Lab UNIVERSITY OF JORDAN Tic-Tac-Toe GAME PROJECT Embedded lab Engineers Page 1 of 5 Preferred Group Size Grading Project Due Date (2) Two is the allowed group size. The group can be from
Lesson 11.3 Independent Events
Lesson 11.3 Independent Events Draw a tree diagram to represent each situation. 1. Popping a balloon randomly from a centerpiece consisting of 1 black balloon and 1 white balloon, followed by tossing a
A Brief Introduction to Game Theory
A Brief Introduction to Game Theory Jesse Crawford Department of Mathematics Tarleton State University April 27, 2011 (Tarleton State University) Brief Intro to Game Theory April 27, 2011 1 / 35 Outline
The Principles Of A.I Alphago
The Principles Of A.I Alphago YinChen Wu Dr. Hubert Bray Duke Summer Session 20 july 2017 Introduction Go, a traditional Chinese board game, is a remarkable work of art which has been invented for more
Werrington Leisure Centre
Kids holiday club timetables Werrington Leisure Centre Book today for Werrington Leisure Centre Our holiday activities run during school holidays for kids aged 4-11 & are a great way to have fun, make
CS39N The Beauty and Joy of Computing Lecture #4 : Computational Game Theory UC Berkeley Computer Science Lecturer SOE Dan Garcia 2009-09-14 A 19-year project led by Prof Jonathan Schaeffer, he used dozens
Tic-tac-toe. Lars-Henrik Eriksson. Functional Programming 1. Original presentation by Tjark Weber. Lars-Henrik Eriksson (UU) Tic-tac-toe 1 / 23
Lars-Henrik Eriksson Functional Programming 1 Original presentation by Tjark Weber Lars-Henrik Eriksson (UU) Tic-tac-toe 1 / 23 Take-Home Exam Take-Home Exam Lars-Henrik Eriksson (UU) Tic-tac-toe 2 / 23
CS325 Artificial Intelligence Ch. 5, Games!
CS325 Artificial Intelligence Ch. 5, Games! Cengiz Günay, Emory Univ. vs. Spring 2013 Günay Ch. 5, Games! Spring 2013 1 / 19 AI in Games A lot of work is done on it. Why? Günay Ch. 5, Games! Spring 2013
Game-Playing & Adversarial Search Alpha-Beta Pruning, etc.
Game-Playing & Adversarial Search Alpha-Beta Pruning, etc. First Lecture Today (Tue 12 Jul) Read Chapter 5.1, 5.2, 5.4 Second Lecture Today (Tue 12 Jul) Read Chapter 5.3 (optional: 5.5+) Next Lecture (Thu
Artificial Intelligence 1: game playing
Artificial Intelligence 1: game playing Lecturer: Tom Lenaerts Institut de Recherches Interdisciplinaires et de Développements en Intelligence Artificielle (IRIDIA) Université Libre de Bruxelles Outline
A Quoridor-playing Agent
A Quoridor-playing Agent P.J.C. Mertens June 21, 2006 Abstract This paper deals with the construction of a Quoridor-playing software agent. Because Quoridor is a rather new game, research about the game
5 Games For Building Logic
5 Games For Building Logic Hands on Math A collection of incredibly awesome math games Edited by Emily Dyke and Joe Dyke A mind is not a vessel to be filled but a fire to be kindled. - Plutarch Hands-
Data Analysis & Probability Counting Techniques & Probability (Notes)
Data Analysis & Probability Counting Techniques & Probability (Notes) Name I can Date Essential Question(s): Key Concepts Notes Fundamental Counting Principle Factorial Permutations Combinations What is
Game playtesting, Gameplay metrics (Based on slides by Michael Mateas, and Chapter 9 (Playtesting) of Game Design Workshop, Tracy Fullerton)
Game playtesting, Gameplay metrics (Based on slides by Michael Mateas, and Chapter 9 (Playtesting) of Game Design Workshop, Tracy Fullerton) UC Santa Cruz School of Engineering courses.soe.ucsc.edu/courses/cmps171/winter14/01
More Activities to Reinforce and Teach Sight Words
More Activities to Reinforce and Teach Sight Words Bean Bag Toss Materials: One shower curtain liner divided into 20 boxes with a permanent marker Bean Bag Words on large cards Attach the words to the
CS 188: Artificial Intelligence Spring 2007
CS 188: Artificial Intelligence Spring 2007 Lecture 7: CSP-II and Adversarial Search 2/6/2007 Srini Narayanan ICSI and UC Berkeley Many slides over the course adapted from Dan Klein, Stuart Russell or
Fraction Card Games. Additional/Supporting Standards: 4.NF.1 Extend understanding of fraction equivalence and ordering
Fraction Card Games Common Core Standard: Extend understanding of fraction equivalence and ordering. 4.NF.2 Compare two fractions with different numerators and different denominators, e.g., by creating
Game Playing. Garry Kasparov and Deep Blue. 1997, GM Gabriel Schwartzman's Chess Camera, courtesy IBM.
Game Playing Garry Kasparov and Deep Blue. 1997, GM Gabriel Schwartzman's Chess Camera, courtesy IBM. Game Playing In most tree search scenarios, we have assumed the situation is not going to change whilst
CS 771 Artificial Intelligence. Adversarial Search
CS 771 Artificial Intelligence Adversarial Search Typical assumptions Two agents whose actions alternate Utility values for each agent are the opposite of the other This creates the adversarial situation
Word Work Choices. During Daily 5, these are the choices they can do for word work. They make a choice and grab a spelling list.
Word Work Choices During Daily 5, these are the choices they can do for word work. They make a choice and grab a spelling list. Letter Cubes Unifix cubes that I wrote letters on. I keep them in baggies.
COMP 400 Report. Balance Modelling and Analysis of Modern Computer Games. Shuo Xu. School of Computer Science McGill University
COMP 400 Report Balance Modelling and Analysis of Modern Computer Games Shuo Xu School of Computer Science McGill University Supervised by Professor Clark Verbrugge April 7, 2011 Abstract As a popular
CS 440 / ECE 448 Introduction to Artificial Intelligence Spring 2010 Lecture #5
CS 440 / ECE 448 Introduction to Artificial Intelligence Spring 2010 Lecture #5 Instructor: Eyal Amir Grad TAs: Wen Pu, Yonatan Bisk Undergrad TAs: Sam Johnson, Nikhil Johri Topics Game playing Game trees
150 Students Can t Be Wrong! GamesCrafters,, a Computational Game Theory Undergraduate Research and Development Group at UC Berkeley
200 150 Students Can t Be Wrong! GamesCrafters,, a Computational Game Theory Undergraduate Research and Development Group at UC Berkeley 2007-11-13 @ 12:00-13:00 EST in Theatre 3 ICT, 111 Barry St, Carlton,
TRAINING CENTER LEADER GUIDE
TRAINING CENTER LEADER GUIDE AUGUST 1-2 Week 1: Let s Move It Action Word: Go! Story: The Shepherds Moved It to go see baby Jesus! Materials: Kiddie Pool (2), Colored Plastic Balls, Masking Tape up against
Taffy Tangle. cpsc 231 assignment #5. Due Dates
cpsc 231 assignment #5 Taffy Tangle If you ve ever played casual games on your mobile device, or even on the internet through your browser, chances are that you ve spent some time with a match three game.
Jack Hunt Swimming Pool & Gym
Kids holiday club timetables Jack Hunt Swimming Pool & Gym Book today for Jack Hunt Swimming Pool & Gym Our holiday activities run during school holidays for kids aged 4-11 & are a great way to have fun,
Level 1: Overview / What is a Game?
Course Overview Level 1: Overview / What is a Game? Originally posted June 29, 2009 Welcome to Game Design Concepts! I am Ian Schreiber, and I will be your guide through this whole experiment. I ve heard
Game Tree Search 1/6/17
Game Tree Search /6/7 Frameworks for Decision-Making. Goal-directed planning Agents want to accomplish some goal. The agent will use search to devise a plan.. Utility maximization Agents ascribe a utility
Monte Carlo Tree Search
Monte Carlo Tree Search 1 By the end, you will know Why we use Monte Carlo Search Trees The pros and cons of MCTS How it is applied to Super Mario Brothers and Alpha Go 2 Outline I. Pre-MCTS Algorithms