Extreme Software Engineering DVONN ® - Mini-Project for XP Spike Extreme Software Engineering - A Hands-On Approach Daniel H. Steinberg Daniel W. Palmer.

Slides:

Advertisements

Similar presentations

How to Play Checkers This presentation is a tutorial on how to play one of the oldest and most popular games in history. Presented by: Joshua Cox Project.

Advertisements

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

DESCRIPTION: China, one of the world's oldest civilizations, consists of states and cultures dating back more than six millennia. This is an abstract.

Adversarial Search Chapter 6 Section 1 – 4. Types of Games.

Tetris – Genetic Algorithm Presented by, Jeethan & Jun.

AE1APS Algorithmic Problem Solving John Drake.  Invariants – Chapter 2  River Crossing – Chapter 3  Logic Puzzles – Chapter 5  Matchstick Games -

ICS-271:Notes 6: 1 Notes 6: Game-Playing ICS 271 Fall 2008.

JENGA and other wooden block games

Hands-on, effective science lessons. TM Copyright © 2007 by Interactive Science Teacher™ Quiz: Heat Transfer Instructions- Number from 1-10 on a piece.

Adversarial Search Chapter 5.

An Alternative Approach for Playing Complex Games like Chess. 1Alternative Game Playing Approach Jan Lemeire May 19 th 2008.

Place captured red pieces here Place captured yellow pieces here To use as Kings Rules New Game Exit Left mouse click on piece – drag to desired location.

Progressively Finite Games

Rolling the Dice: Check the difference between the theory and the practice Karim Noura Master of Education KN, Oct 2008.

Strategy Games for Older Students YUMI DEADLY CENTRE School of Curriculum Enquiries: YuMi Deadly.

Chinese Checkers by Ethan Chang & Cyrus Dastangoo.

RULES Each player begins the game with twelve normal pieces (either white or black). The pieces are automatically set in their proper positions. The object.

ICS-271:Notes 6: 1 Notes 6: Game-Playing ICS 271 Fall 2006.

1 Game Playing Chapter 6 (supplement) Various deterministic board games Additional references for the slides: Luger’s AI book (2005). Robert Wilensky’s.

© 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.

Chair of Software Engineering Einführung in die Programmierung Introduction to Programming Prof. Dr. Bertrand Meyer Exercise Session 9.

Wei Qi, Baduk, Go a game of strategy

Great Theoretical Ideas in Computer Science.

Find all the factors pairs of 12

Matthew Marcon Project 19 1/10/12

Game Playing State-of-the-Art  Checkers: Chinook ended 40-year-reign of human world champion Marion Tinsley in Used an endgame database defining.

Invariant Method

CISC 235: Topic 6 Game Trees.

Uncovering Algebraic Connections in Dice-y Problem Solving Situations Steve Benson Education Development Center Newton MA Electronic.

An Introduction to 10 Frames. How many apples do you see? Now how many do you see?

We will begin Please find a seat near colleagues from different departments Ask your neighbors about a topic they would like to teach more effectively,

Artificial Intelligence in Game Design Lecture 22: Heuristics and Other Ideas in Board Games.

By: Joe Merullo Julia Stone and Olivia Pollock. Who plays the game? The game is played by two players who alternately place black and white stones on.

Investigation #1 Factors and Products.

Ikaruga Charlie Cross CIS Overview Released in 2001 in Japanese Arcades. Released for Dreamcast in 2002 Finally released for Gamecube in.

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.

Adversarial Search Chapter 6 Section 1 – 4. Outline Optimal decisions α-β pruning Imperfect, real-time decisions.

Game City In this project you will learn the basics of visual programming to start creating your own games. The tool you will be using to do this is Microsoft.

Chinese Checkers. How to play Chinese Checkers is a simple board game that can be played by two to six people. The point of the game is to place all of.

Games. Adversaries Consider the process of reasoning when an adversary is trying to defeat our efforts In game playing situations one searches down the.

Introduction to Morris Games Originally Compiled by Michelle Sharp With contributions by Walter Voit, Kedar Naidu, & James Latham 7 February 2007.

HPC Checkers By Andy Block Ryan Egan. Table of Contents Overview of Checkers ▫Overview of Checkers ▫Rules of the Game AI Theory The Program ▫Board ▫Sample.

How to Play Checkers This presentation is a tutorial on how to play on of the oldest and most popular games in history. Presented By: Cathryn Depuy Project.

Draughts. Introduction Draughts is played on the same chequered board as chess and has been played in Europe since the end of the 1100s. It is similar.

Senior Project Poster Day 2007, CIS Dept. University of Pennsylvania Reversi Meng Tran Faculty Advisor: Dr. Barry Silverman Strategies: l Corners t Corners.

A Classic Game of Strategy for the 21 st Century.

Cilk Pousse James Process CS534. Overview Introduction to Pousse Searching Evaluation Function Move Ordering Conclusion.

Chapter 9 Putting together a complete system. This chapter discusses n Designing a complete system. n Overview of the design and implementation process.

Public Politics Professor Jonathan Day The Presidency (POLS 318)

Summary of the Moves of Chess

Rolling the Dice: Finding Algebraic Connections by Chance Steve Benson Education Development Center Newton MA Electronic versions.

Every chess master was once a beginner. Irving Chernev

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.

ARTIFICIAL INTELLIGENCE (CS 461D) Princess Nora University Faculty of Computer & Information Systems.

How To Play Checkers This Presentation on how to play one of the oldest and most popular games in history. Gage Holzhauer Checkers 1/18/12.

The Lovely Game of NIM. Version 1 - Classic NIM You will need seven objects, such as counters or blocks. It is a game for two players. Place the 7 counters.

Checkers A Matlab Project by Spenser Davison, Edward Dyakiw, Justin Pezzi, and Scott Wu.

Adversarial Search. Regular Tic Tac Toe Play a few games. –What is the expected outcome –What kinds of moves “guarantee” that?

Patrick Racy Project 19 1/9/12

Explorations in Artificial Intelligence Prof. Carla P. Gomes Module 5 Adversarial Search (Thanks Meinolf Sellman!)

Extreme Software Engineering A Hands-On Approach From Extreme Software Engineering: A Hands-On Approach Daniel H. Steinberg Daniel W. Palmer.

ADVERSARIAL SEARCH Chapter 6 Section 1 – 4. OUTLINE Optimal decisions α-β pruning Imperfect, real-time decisions.

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.

Levels of Verification Figure 2.2 p 37 Verification is applied at all different abstraction levels Mostly bottom up, some top down.

Game Playing Why do AI researchers study game playing?

Presented by: Jacob Thurston Project 19 – How to Play Checkers 3/8/12

Damath History Damath comes from the Filipino checker board game called “dama” and mathematics Invented in 1975 by Jesus Huenda, a teacher from Sorsogon,

FOUR PLAYER CHESS.

CheckerBoard Square 1 has 8 Row of Squares Dark Square Light Square 1

Presentation transcript:

Extreme Software Engineering DVONN ® - Mini-Project for XP Spike Extreme Software Engineering - A Hands-On Approach Daniel H. Steinberg Daniel W. Palmer

Extreme Software Engineering What is DVONN? Games Magazine’s “Game of the Year” 2002

Extreme Software Engineering What is DVONN? 2-player abstract strategy game –has features similar to Go, Checkers, and Othello Invented by Kris Burm –creator of the Gipf Project Copyright holder: Don & Co. More Info:

Extreme Software Engineering Why a DVONN Mini-Project? Simple enough to understand, yet unfamiliar Complex enough for a non-trivial example –unlike tic-tac-toe, etc. Unfamiliarity gives more realism to spike’s client interactions –students will not have preconceived ideas –will rely on client to explain the features

Extreme Software Engineering How to Play DVONN The DVONN board is an elongated hexagon. The game uses 23 white pieces, 23 black pieces and 3 red DVONN pieces. x 23

Extreme Software Engineering How to Play DVONN Initially the board is empty. The game begins with the players alternately placing the DVONN pieces on the board. They then alternately place their own pieces.

Extreme Software Engineering How to Play DVONN Only pieces that are not surrounded (at least one of the six adjacent locations must be empty) can move. Initially, only the edge pieces can move.

Extreme Software Engineering How to Play DVONN The players make moves by stacking pieces.

Extreme Software Engineering How to Play DVONN After moves have been made, some pieces previously surrounded can now move.

Extreme Software Engineering How to Play DVONN Single pieces may move 1 space in any of 6 directions, stacks of two pieces may move two spaces in a straight line, etc.

Extreme Software Engineering How to Play DVONN A stack must always be moved as a whole and a move must always end on top of another piece or stack.

Extreme Software Engineering How to Play DVONN Pieces (single stacks) and taller stacks must always remain in contact with some DVONN piece, either singly or in a stack.

Extreme Software Engineering How to Play DVONN If pieces or stacks do lose contact with all DVONN pieces, they must be removed from the board.

Extreme Software Engineering How to Play DVONN The game ends when no more moves can be made.

Extreme Software Engineering How to Play DVONN The players put the stacks they control on top of each other and the one with the highest stack is the winner = = 8 winner!