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

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

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.
Martin Boyd Christopher Hirunthanakorn
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.
AE1APS Algorithmic Problem Solving John Drake.  Invariants – Chapter 2  River Crossing – Chapter 3  Logic Puzzles – Chapter 5  Matchstick Games -
Tic Tac Toe Game Design Using OOP
DATA STRUCTURES AND ALGORITHMS.  The project that we worked on is a well known game called “Tic Tac Toe”.  We implemented this game using a binary tree.
CHESS FOR KIDS Lesson 1.
Games CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Chess AI’s, How do they work? Math Club 10/03/2011.
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.
Artificial Intelligence in Game Design
Chinese Checkers by Ethan Chang & Cyrus Dastangoo.
Extreme Software Engineering DVONN ® - Mini-Project for XP Spike Extreme Software Engineering - A Hands-On Approach Daniel H. Steinberg Daniel W. Palmer.
CPSC 322 Introduction to Artificial Intelligence October 25, 2004.
Connect Four Michelle Chen Felix Chung Annabel Hung Raymond Wong.
November 10, 2009Introduction to Cognitive Science Lecture 17: Game-Playing Algorithms 1 Decision Trees Many classes of problems can be formalized as search.
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.
MAE 552 – Heuristic Optimization Lecture 28 April 5, 2002 Topic:Chess Programs Utilizing Tree Searches.
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.
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.
Adversarial Search: Game Playing Reading: Chess paper.
THE RENJU GAME BY ABHISHEK JAIN, PRANSHU GUPTA & RHYTHM DAS PCLUB SUMMER PROJECT PRESENTATION JUNE, L7 IIT KANPUR MENTOR – SANIL JAIN.
NON-ELECTRIC GAMES Game Art and Design GAD Instructor: Sylvester Ngoma.
Unit I: History and ethics of game design Non-electric Games GAD.
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.
CSC 412: AI Adversarial Search
CISC 235: Topic 6 Game Trees.
Investigation #1 (cont.)
Othello Artificial Intelligence With Machine Learning
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.
Computer Go : A Go player Rohit Gurjar CS365 Project Proposal, IIT Kanpur Guided By – Prof. Amitabha Mukerjee.
October 3, 2012Introduction to Artificial Intelligence Lecture 9: Two-Player Games 1 Iterative Deepening A* Algorithm A* has memory demands that increase.
Connect Four AI Robert Burns and Brett Crawford. Connect Four  A board with at least six rows and seven columns  Two players: one with red discs and.
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.
Basic Facts Junior Focus Group 23 November 2010 Raewyn Carman & Dianne Ogle.
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.
Investigation #1 (cont.) Products and Multiples. 1.3 The Product Game.
Cilk Pousse James Process CS534. Overview Introduction to Pousse Searching Evaluation Function Move Ordering Conclusion.
Outline Intro to Representation and Heuristic Search Machine Learning (Clustering) and My Research.
Lesson 10.6a AIM: Variations on Linear Nim. DO NOW.
Summary of the Moves of Chess
Introduction to Game Theory Kamal Aboul-Hosn Cornell University Computers Playing Games.
Every chess master was once a beginner. Irving Chernev
A Levoy PowerPoint Presentation
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.
Othello Artificial Intelligence With Machine Learning Computer Systems TJHSST Nick Sidawy.
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.
Adversarial Search. Regular Tic Tac Toe Play a few games. –What is the expected outcome –What kinds of moves “guarantee” that?
February 25, 2016Introduction to Artificial Intelligence Lecture 10: Two-Player Games II 1 The Alpha-Beta Procedure Can we estimate the efficiency benefit.
Patrick Racy Project 19 1/9/12
Explorations in Artificial Intelligence Prof. Carla P. Gomes Module 5 Adversarial Search (Thanks Meinolf Sellman!)
Artificial Intelligence in Game Design Board Games and the MinMax Algorithm.
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.
By Kevin Madison and Emma Drobina
Iterative Deepening A*
Next Level Tic-Tac-Toe
Adversarial Search.
Presented by: Jacob Thurston Project 19 – How to Play Checkers 3/8/12
Adversarial Search Chapter 5.
Kevin Mason Michael Suggs
NIM - a two person game n objects are in one pile
Introduction to Artificial Intelligence Lecture 9: Two-Player Games I
FOUR PLAYER CHESS.
CS51A David Kauchak Spring 2019
Unit II Game Playing.
Presentation transcript:

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

Morris Games in History This is a classic, ancient game The game has many different names: Merelles, Merrills, Merreles, Merrels, Merrelus, Marels, Marelles, Marrills, Muhle, Muehle, Muller, Morell, Morelles, Molenspel, Mills, Mylla, Mlynek, Mylta and Morris The name merels comes from the low Latin word merrelus, meaning a 'token, counter or coin' Versions have been found dating all the way back to 1400 BC.

Morris Games in History (cont) Found carved into such diverse places as Egyptian pyramids, a shrine at Ceylon, and in a burial site in Bronze Age Ireland In Britain, buildings have boards in positions that are impossible to play, so it is assumed that stonemasons played on them before using the stone in construction. Mentioned in Shakespeare’s A Midsummer Night’s Dream Reached height of popularity in 14 th Century Europe

Modern Morris Games One variation still extremely popular with children Three Men’s Morris ≈ Tic Tac Toe Most popular version with adults is Nine Men’s Morris World Championships held until 1997 Most popular in German-speaking countries Multiple online discussion groups exist Game is used often in AI classes and for research Gasser solved Nine Men’s Morris in 1993 Conclusion: when played well, it always comes to a draw

Variations Game play is simple but strategy is complex Entire books have been written on play strategy Variations in board layouts and number of game pieces Number in title dictates number of pieces per player Board layouts get more complex as number in title increases We will use Morris Game, Variant-C, a variant of Nine Men’s Morris

Example Layouts Seven Men’s Morris Nine Men’s Morris, Var C Eleven & Twelve Men’s Morris Five & Six Men’s Morris Three Men’s Morris Three & Four Men’s Morris Our Project

Variant-C Modified Nine Men’s Morris Game board 9 pieces per side; black vs. white Can only place on line intersections, yielding 21 spaces

Handout Handout is only to provide background on game and to help students get familiar with it Only includes resources, analyses and implementations of Nine Men’s Morris because it is most popular and closest to our game Shareware and commercial software links excluded Except where noted, only looked at references that are in English

Rules Remember: For the purposes of the class, the teacher’s version of the rules is the only one that matters! Game play is like a cross between Tic Tac Toe and Checkers. Goal is to capture your opponent’s pieces by getting three pieces in a row (called a “mill”) The winner is the first player to reduce the opponent to only 2 tokens, or blocks the opponent from any further moves There are three phases of play

Rules (cont) Opening Players take turns placing pieces on any vacant board intersection spot until all pieces have been placed Midgame Once all the pieces are placed, then take turns moving one piece along a board line to any adjacent vacant spot Endgame When a player is down to only three game pieces, then they may move a piece to any open spot, not just an adjacent one (“hopping”)

Mills At any stage if you get three pieces in a row along the same straight board line, then you may remove one isolated opponent’s piece from play. An isolated piece is a piece that is not part of a mill. Rules (cont)

"We describe the combination of two search methods used to solve Nine Men's Morris. An improved analysis algorithm computes endgame databases comprising about 10 billion states. An 18-ply alpha-beta search then used these databases to prove that the value of the initial position is a draw. Nine Men's Morris is the first non-trivial game to be solved that does not seem to benefit from knowledge-based methods." In other words, they got the machine to work out and tabulate 10 billion positions that they knew were a win for one side or the other, then worked forward 18 moves from the beginning of the game until their opening analysis met their endgame analysis. Result, a recipe for perfect play that guarantees either side freedom from defeat. --From Ralph Gasser’s paper Following the pros

Let’s Play!Let’s Play!