A Game AI Coding Competition Pavel Dionisev & Nicolas Décrevel CERN

Slides:



Advertisements
Similar presentations
Us vs. It. Tanks vs. Robot Turn-based Cooperative StrategyTurn-based Cooperative Strategy Tank players must destroy the Robot before it reaches the city.
Advertisements

SAMPLE TURN. Sample Three Player Starting Setup. After each player has selected their army and five Starting Troops, The remaining tiles are mixed and.
1-16 Tournament Rap Up Double Elimination: AKA two loss and out Advantages: –One of the fairest types of tournaments –Gives participants at least.
Tetris – Genetic Algorithm Presented by, Jeethan & Jun.
Dave Pottinger,
Us vs. It. Tanks vs. Robot ● Cooperative “Boss Fight” ● Tank players must destroy the Robot before it reaches the city limits. ● Robot is controlled by.
Click to Continue Project Four Sticks Bye Bye Pillow Games Producer / Stacie Rajkovics Lead Developer/ Sota Ogo Developer and Assistant Designer / Joseph.
PAINTBALL Everything you never needed to know…. Common Perceptions A typical Paintballer.
Microsoft® Small Basic Advanced Games Estimated time to complete this lesson: 1 hour.
YSAF Advisor Meeting 11/11/13. What is YSAF? Similar to Academic League Topics: History, Science, Literature, Math, General Knowledge, Current Events.
For the ultimate in entertainment, play with 2 or more people, individually or as a team Players alternate turns Each player picks an “answer” and must.
Us vs. It. Tanks vs. Robot ● Cooperative “Boss Fight” ● Tank players must destroy the Robot before it reaches the city limits. ● Robot is controlled by.
Aquila Rise of the Emperor. Overview – Aquila ► A turn based strategy game set in Ancient Rome. ► Your Goal is to become Emperor by eliminating your enemies.
Connect Four Michelle Chen Felix Chung Annabel Hung Raymond Wong.
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.
© 2007 Ray S. Babcock Tracks Game is played on a (nxn) set of squares. There are three possible moves (labeled A,B,C). Players alternate making a move.
1 Turn on the Wii, go to the Wii menu.. 2 Click on the Wii options.
PING PONG (Table Tennis)
Indian Institute of Technology Hyderabad SOS - The Game A Project by Paritosh J Chandran Prakhar Bharadwaj Ganesh Mahidhar Nagarjun Srinivasan.
Final Presentation – CS 425 Aaron O'Banion Todd Astroth Chris Cobb Matt Stowe Mark Williams.
Three Musketeers. Game Rules ● One player is the Musketeers ● The other is the Cardinal.
 I The game  II Gameplay  III Champions  IV A game… Not only !
Investigation #1 (cont.)
Database Chess A server-based web gaming application by Jordan Arnold.
Probability (Grade 12) Daljit Dhaliwal. Sticks and Stones game.
PUERTO RICAN DOMINO GAME Cameron, Max, and Lauren.
Gabe Hughes CIS 597 – Spring 13. Languages All WoW add-ons are written in.lua, a scripting language useful in games, with extensive API support WoWAce.
Design of a real time strategy game with a genetic AI By Bharat Ponnaluri.
Game-playing AIs Part 1 CIS 391 Fall CSE Intro to AI 2 Games: Outline of Unit Part I (this set of slides)  Motivation  Game Trees  Evaluation.
Game Playing. Towards Intelligence? Many researchers attacked “intelligent behavior” by looking to strategy games involving deep thought. Many researchers.
Games. Adversaries Consider the process of reasoning when an adversary is trying to defeat our efforts In game playing situations one searches down the.
Machine Learning for an Artificial Intelligence Playing Tic-Tac-Toe Computer Systems Lab 2005 By Rachel Miller.
Investigation #1 (cont.) Products and Multiples. 1.3 The Product Game.
Rules “rules, play, culture”. COSC 4126 rules Rules of Tic-Tac-Toe 1.Play occurs on a 3 by 3 grid of 9 squares. 2.Two players take turns marking empty.
Turn Based Strategy Game
DEEP RED An Intelligent Approach to Chinese Checkers.
28 minutes before 6 players setup Basic move Each player gets per turn: 1.Max 3 people per move 2.Max 3 zombies per move.
User Interface Design TRASE Project Software Engineering Fall 2008.
Analyzing Puzzles and Games. What is the minimum number of moves required to complete this puzzle?
TV Pool App Description File Version 3.0 Submission Date12/08/Y2015 App Ver App Developer.*************************
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.
Event Management Scheduling.
Troops and Flags ITCS /10/07. Graduate Team #1 Daniel – Model (Team Leader) Jonathan –Rule Checker Priyesh – View, Sprites, Foley artist Rob –
Multiples and Factors. Multiples A multiple is a number that is in the times tables. A multiple is a number that is in the times tables. Multiples of.
First, I should introduce you a computer game. It’s Called League of Legends (LOL). Please ignore strange grammar.
Troops and Flags Graduate Group #1 Introduction to Game Design and Development 12/10/2007.
Troops and Flags Graduate Group #1 Introduction to Game Design and Development 12/10/2007.
when one player is attacking another player’s territory, the maximum troops they can attack with is 3, so they roll 1, 2, or 3 dice, depending on how.
Created by Jordan Timbs 10/09/10. Motor Skills and Movement Patterns  The Student will demonstrate basic motor skills in three or more of the.
COACH.
(1) Introduction to Robocode Philip Johnson Collaborative Software Development Laboratory Information and Computer Sciences University of Hawaii Honolulu.
The Standard Genetic Algorithm Start with a “population” of “individuals” Rank these individuals according to their “fitness” Select pairs of individuals.
CS12230 Introduction to Programming Extra example– More on responsibilities 1.
Design of a real time strategy game with a genetic AI By Bharat Ponnaluri.
Approaches Workbook Conditioned Games – Teacher Answers.
Goo Wars Clausewitz Sandbox Shapes Mass Size Density Motivation Ancient War is the interaction of shapes. Fighting occurs at the intersection of these.
2015 Fall Season. Meet the board Club Affiliations Calendar Annual General Meeting Rules of Play and Code of Ethics Parents Notes Uniforms Volunteer Opportunities.
CSCI-256 Data Structures & Algorithm Analysis Lecture Note: Some slides by Kevin Wayne. Copyright © 2005 Pearson-Addison Wesley. All rights reserved. 3.
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.
Section 5.5 Application: The Card Game of War. 5.5 Application: The Card Game of War A deck of cards is shuffled and dealt to two players The players.
An Implementation of the Card Game “Solo”
Negotiation Game Rules
Math 331: Problem Solving Steven J Miller
A First Grade Number Routine
If you win or lose, it is important to ALWAYS be a good sport.
Us vs. It.
Game Theory Day 2: More Simple Games.
Us vs. It.
Us vs. It.
2019 SAIMC Puzzle Challenge General Regulations
Presentation transcript:

A Game AI Coding Competition Pavel Dionisev & Nicolas Décrevel CERN Grid Wars 2015 A Game AI Coding Competition Pavel Dionisev & Nicolas Décrevel CERN 02/11/2015 JINR/CERN AIS-GRID | Grid Wars 2015

JINR/CERN AIS-GRID | Grid Wars 2015 Let’s PLAY ! Action speaks louder than words. Pavel can you show them the GAME ! 02/11/2015 JINR/CERN AIS-GRID | Grid Wars 2015

JINR/CERN AIS-GRID | Grid Wars 2015 Mechanics Start: 50x50 cells board 100 troops per player in one random cell Players take alternating turns to move troops 100 50 100 50 10 60 Start Turn 1 Turn 2 02/11/2015 JINR/CERN AIS-GRID | Grid Wars 2015

JINR/CERN AIS-GRID | Grid Wars 2015 Movement No diagonals The board is a torus Edges wrap around 50 10 60 30 50 20 10 60 02/11/2015 JINR/CERN AIS-GRID | Grid Wars 2015

JINR/CERN AIS-GRID | Grid Wars 2015 Battle What if I invade your cell? Fight! Simple comparison (more troops wins) Surviving = Winning - Losing Battles occur after every turn (not round) 10 5 3 7 5 3 2 5 Battle 02/11/2015 JINR/CERN AIS-GRID | Grid Wars 2015

JINR/CERN AIS-GRID | Grid Wars 2015 Population growth After every round (1 turn per player) Growth rate (+10%) Rounding (1 * 1.4 -> 1) Maximum population 100/cell Before +10% After 1 1.1 2 2.2 3 3.3 4 4.4 5 5.5 6 3 5 2 1 6 3 6 2 1 7 +10% 02/11/2015 JINR/CERN AIS-GRID | Grid Wars 2015

JINR/CERN AIS-GRID | Grid Wars 2015 Winning Last surviving player or highest population after 1000 rounds 02/11/2015 JINR/CERN AIS-GRID | Grid Wars 2015

JINR/CERN AIS-GRID | Grid Wars 2015 How to participate? Do I need amazing skills? Basic programming knowledge is enough Simple examples provided What if I have no clue at all? You can form a team with someone who knows Take part in defining the strategy 02/11/2015 JINR/CERN AIS-GRID | Grid Wars 2015

JINR/CERN AIS-GRID | Grid Wars 2015 How to participate? Gather a team or go Solo Register a username on gridwars.cern.ch Register your team under the team link on gridwars.cern.ch 02/11/2015 JINR/CERN AIS-GRID | Grid Wars 2015

JINR/CERN AIS-GRID | Grid Wars 2015 Bot development Demo 02/11/2015 JINR/CERN AIS-GRID | Grid Wars 2015

JINR/CERN AIS-GRID | Grid Wars 2015 Competition Unlimited uploads Last upload is considered submitted to the competition Server performs continuous 1v1 battles Play against all other active bots up to N times View games as soon as they are finished 02/11/2015 JINR/CERN AIS-GRID | Grid Wars 2015

JINR/CERN AIS-GRID | Grid Wars 2015 Other rules Illegal movement = all movements ignored Thread creation is not allowed Stateful bots are allowed Use of external libraries is discouraged Max JAR file size is 10 MB Time-out on constructor Your bot will be idle during that match Time-out on each turn Commands added before time-out will be OK 02/11/2015 JINR/CERN AIS-GRID | Grid Wars 2015

JINR/CERN AIS-GRID | Grid Wars 2015 Schedule Game starts now Tomorrow Hackathon Wednesday Lunch: end of upload Afternoon: end of competition ceremony 02/11/2015 JINR/CERN AIS-GRID | Grid Wars 2015

JINR/CERN AIS-GRID | Grid Wars 2015 Let’s Play ! grid.wars@cern.ch 02/11/2015 JINR/CERN AIS-GRID | Grid Wars 2015