Game Mechanics. Genre Extends traditional turn-based strategy style gaming with time restricted turns and realtime fighting mechanics.

Slides:



Advertisements
Similar presentations
The Gym: Where The Incredible Hulk Goes To Train Bryan Brandt Lead Gameplay Programmer Kevin Coughlan Technical Director
Advertisements

Game Procedures Who does what, where, when, and how?
Windows Basics: The Mouse. The Mouse Before you can explore the Desktop and Taskbar, you must know how to use your mouse. Your mouse is a pointing device.
Adversarial Search We have experience in search where we assume that we are the only intelligent being and we have explicit control over the “world”. Lets.
And-Or Graphs CSCE 580 Spr03 Instructor: Marco Valtorta Hrishikesh J. Goradia Seang-Chan Ryu.
Techniques for Dealing with Hard Problems Backtrack: –Systematically enumerates all potential solutions by continually trying to extend a partial solution.
Using Eclipse. Getting Started There are three ways to create a Java project: 1:Select File > New > Project, 2 Select the arrow of the button in the upper.
ECO290E: Game Theory Lecture 9 Subgame Perfect Equilibrium.
Game Playing (Tic-Tac-Toe), ANDOR graph By Chinmaya, Hanoosh,Rajkumar.
Computer Science C++ High School Level By Guillermo Moreno.
Adversarial Search 對抗搜尋. Outline  Optimal decisions  α-β pruning  Imperfect, real-time decisions.
Introduction to Graph Theory Lecture 19: Digraphs and Networks.
Problem Solving Using Search Reduce a problem to one of searching a graph. View problem solving as a process of moving through a sequence of problem states.
1 search CS 331/531 Dr M M Awais A* Examples:. 2 search CS 331/531 Dr M M Awais 8-Puzzle f(N) = g(N) + h(N)
Kinematics. ILE5030 Computer Animation and Special Effects2 Kinematics The branch of mechanics concerned with the motions of objects without regard to.
Key Fu Design Challenge To create a game that blends the fighting and music game genres in a fun and innovative way. Time limit: 10 weeks Game Concept.
CS2420: Lecture 15 Vladimir Kulyukin Computer Science Department Utah State University.
Introduction To Form Builder
XML –Query Languages, Extracting from Relational Databases ADVANCED DATABASES Khawaja Mohiuddin Assistant Professor Department of Computer Sciences Bahria.
THE RENJU GAME BY ABHISHEK JAIN, PRANSHU GUPTA & RHYTHM DAS PCLUB SUMMER PROJECT PRESENTATION JUNE, L7 IIT KANPUR MENTOR – SANIL JAIN.
Cos 381 Day 7. © 2006 Pearson Addison-Wesley. All rights reserved. 6-2 Agenda Assignment 2 Posted –Program a web-based Version of Soduku using JavaScript.
Game Theory 2 Computer solutions.
Introduction to Excel 2007 Part 3: Bar Graphs and Histograms Psych 209.
Reviewing Common Blocks for St. Agnes Elementary School Teachers by Jenny Chang Feb. 26th, 2007 USC & University Neighborhood Outreach Robotics STEM program.
LEGO Mindstorms NXT Programming We will be using the Common Palette for our Robots This is how you download your program onto the brick Drag and drop a.
Warm Up Find a triple if r = 10 and s = 2.
1 Turn on the Wii, go to the Wii menu.. 2 Click on the Wii options.
Chen Raz Requirements: 1. HTML5/CSS3 (I remind you that we have an agreement that you don't charge me extra for this) 2. Do not use the html element 3.
1.5 Functions and Logarithms. One-to-One Functions Inverses Finding Inverses Logarithmic Functions Properties of Logarithms Applications …and why Logarithmic.
GUI development with Matlab: GUI Front Panel Components 1 GUI front panel components In this section, we will look at -GUI front panel components -Programming.
Introduction Of Tree. Introduction A tree is a non-linear data structure in which items are arranged in sequence. It is used to represent hierarchical.
A Summary of XISS and Index Fabric Ho Wai Shing. Contents Definition of Terms XISS (Li and Moon, VLDB2001) Numbering Scheme Indices Stored Join Algorithms.
Creating Links – Lesson 31 Creating Links Lesson 3.
Multiway Trees. Trees with possibly more than two branches at each node are know as Multiway trees. 1. Orchards, Trees, and Binary Trees 2. Lexicographic.
Chapter 13 B Advanced Implementations of Tables – Balanced BSTs.
Screens are a direct copy of the physical text. To learn the material for this course, begin by reading the textbook section. At first glance, the pages.
Probability With Number Cubes Today’s Learning Goals  We will continue to understand the link between part-whole ratios, decimals, and percents.  We.
Topic 3 Games in Extensive Form 1. A. Perfect Information Games in Extensive Form. 1 RaiseFold Raise (0,0) (-1,1) Raise (1,-1) (-1,1)(2,-2) 2.
Lecture 10 JavaScript: DOM and Dynamic HTML Boriana Koleva Room: C54
Higher Grade / Intermediate 2 Skills & Techniques.
Swing - 2 Session 13. Swing - 2 / 2 of 38 Objectives (1) Discuss trees and tables Discuss progress bars Discuss MVC architecture Describe menus.
Winning Strategies of Games Played with Chips. I got a interesting game Now we show the game P 1 =4 P 2 =6 P 3 =8 Rule 1: Two players.
Transparency 6 Click the mouse button or press the Space Bar to display the answers.
Kalpaware presents. Demo.
Binary Tree 10/22/081. Tree A nonlinear data structure Contain a distinguished node R, called the root of tree and a set of subtrees. Two nodes n1 and.
Lecture Coursework 2 AGAIN. Rectangle Game Look at proof of matchsticks A rectangular board is divided into m columns by n rows. The area of the board.
Something about the Game Engine 昱泉 InterServ 王銓彰 Kevin C. Wang.
DATA STRUCTURE BS(IT)3rd. Tree An Introduction By Yasir Mustafa Roll No. BS(IT) Bahauddin Zakariya University, Multan.
FIGHT! Play Game. Instructions How To Play.. This game is fairly easy to get going. The first thing you'll need to select a deck. Once you have chosen.
Data Structures Lakshmish Ramaswamy. Tree Hierarchical data structure Several real-world systems have hierarchical concepts –Physical and biological systems.
Trees and Graphs CSE 2320 – Algorithms and Data Structures Vassilis Athitsos University of Texas at Arlington 1.
Econ 522 Economics of Law Dan Quint Fall 2011 Lecture 6.
ALGORITHMS THIRD YEAR BANHA UNIVERSITY FACULTY OF COMPUTERS AND INFORMATIC Lecture nine Dr. Hamdy M. Mousa.
TOPIC : Fault detection and fault redundancy UNIT 2 : Fault modeling Module 2.3 Fault redundancy and Fault collapsing.
Extensive Form (Dynamic) Games With Perfect Information (Theory)
Tree - in “math speak” An ________ graph is a set of vertices/nodes and a set of edges, each edge connects two vertices. Any undirected graph in which.
Space Knight John Gaffrey CIS 488 Game Pitch. Style Concept A futuristic sci-fi world, with a medieval or gothic style of technology A futuristic sci-fi.
Tank Game Part 2 of 6. Firing Shells Coming up… Players Scores Large Explosions Small Explosions Damage Health Bars Parent Shell Destructible Walls Reappear.
Computer Graphics I, Fall 2008 Hierarchical Modeling I.
Recursively Defined Sequences Lecture 40 Section 8.1 Wed, Apr 11, 2007.
Chapter 6 © 2003 by Addison-Wesley, Inc Introduction - Dynamic HTML is not a new markup language - A dynamic HTML document is one whose tag attributes,
DATA STRUCURES II CSC QUIZ 1. What is Data Structure ? 2. Mention the classifications of data structure giving example of each. 3. Briefly explain.
CIS 350 – I Game Programming Instructor: Rolf Lakaemper.
Creating Links – Lesson 3
RYU PIXAL ART For this project we worked toward learning animation using street fighter characters and pixel art to replicate rye hudukon in a pixel.
AP Calculus Chapter 1 Section 2
Huffman Encoding Huffman code is method for the compression for standard text documents. It makes use of a binary tree to develop codes of varying lengths.
Important Problem Types and Fundamental Data Structures
Red-Black Implementation of 2-3 Trees
COMPILER CONSTRUCTION
Presentation transcript:

Game Mechanics

Genre Extends traditional turn-based strategy style gaming with time restricted turns and realtime fighting mechanics.

Contents Fighting Combo/Attack Tree C/A Tree - Battle play mechanics Mockup ”Timed turns”-based

Fighting Combo/Attack Tree C/A Tree - Battle play mechanics Mockup

Combo/Attack Tree The attack tree is a dynamic multi-way tree of connected attacks composed by the player. An attack has the following properties A level indicator or attack-type identifier An attack in game is represented by battle chips

Combo/Attack Tree – Contd. An attack tree is a multi-way tree where each node’s depth represents the level. A B D C FE Level 0 Level 1 Level 2 In the figure above the following attacks can be performed: A A->B A->C A->B->D A->B->E A->B->F

Combo/Attack Tree – Battle Play Mechanics An attack (battle chip) may have several output links. A link allows the attachment of a +1 level higher battle chip A link enforces the following requirements when attaching a battle chip: The link must be assigned an attack key/button. This is chosen by the player. The attached battle chip’s level must be exactly +1 level higher. Some battle chips have special link requirements Any attached battle chips must be of a specific kind, i.e. gun (ranged) or saber (melee). 1 Level indicator Output link A Assigned attack button 2

Combo/Attack Tree – Battle Play Mechanics - Contd. Some battle chips have special parent link requirements In the example to the left the player has attached an “Air Slash” battle chip to the “Upper cut” battle chip and the button A to trigger it. The “Uppercut” attack launches the opponent into the air. Since the “Rolling Air Slash” attack is an airborne attack the player must first be airborne before the attack can be initiated. This enforces an additional button press to its parent link, namely the jump button. N Output link A Assigned attack button N+1 Battle chip: Uppercut Battle chip: Rolling Air Slash JUMP+

Combo/Attack Tree – Battle Play Mechanics - Contd. There are two types of special battle chips, the wildcards and the finishing moves. Finishing moves These chips can be attached to any battle chip (except for wildcards). These chips are finishing moves and ends the combo but in turn deals massive damage. The damage output is affected by the combo count.

Combo/Attack Tree – Battle Play Mechanics - Contd. Wildcards The wildcards can be attached to any battle chip (except finishing moves). Wildcards have exactly one output link and it must be assigned to an existing level 1 battle chip in the tree. No attack button can be assigned, it will have the same attack button as for the selected level 1 battle chip. This allows for cyclic graphs => virtually infinite combos. Level 1 Level 2 Level 3 AA C B * Wildcard battle chip

Combo/Attack Tree – Battle Play Mockup Initial pose Idle AAB Attack tree root Thrust Slash Rolling axe kick Current position in hierarchy

Combo/Attack Tree – Battle Play Mockup – Contd. Currently only one attack can be initiated from the root When the player presses attack button A to initiate the attack… For every attack that is performed a special time bar widget appears showing the remaining animation time for the attack (Appears only if the current attack branches). AAB Attack tree root Thrust Slash Rolling axe kick Current position in hierarchy Time into the animation A Pressed The thrusting attack is performed

Combo/Attack Tree – Battle Play Mockup – Contd. AAB Attack tree root Thrust Slash Rolling axe kick Current position in hierarchy Time into the animation Attack The player character’s current state, thrust, branches into two different attacks. The input for initiating a connected attack must occur during a specific time window. The time window is active during 80-95% of current animation. Since attack button A was pressed the player character will start performing the slashing attack. A Pressed