Jiang Zun Herbert Lee CS 491 August 28, 2006. What is Jiang Zun? ● Jiang Zun is an electronic Chinese Chess client.  Chinese Chess, or Xiang Qi, is a.

Slides:

Advertisements

Similar presentations

The earliest literary reference to Xiangqi comes from the 6th century. [8] [8] One theory is that Xiangqi came from the "classic" war between the.

Advertisements

METAGAMER: An Agent for Learning and Planning in General Games Barney Pell NASA Ames Research Center.

CS 4701 – Practicum in Artificial Intelligence Pre-proposal Presentation TEAM SKYNET: Brian Nader Stephen Stinson Rei Suzuki.

White to move… Checkmate in one move…. Solution Click Solution to see which piece to move. Click it again to see where to move.

Tic Tac Toe size(600,600); Aim: How can we set up our canvas and display for a Tic Tac Toe game? 1. Sketch the two drawings and write the two code.

CS 484 – Artificial Intelligence

Tic Tac Au-Toe-Mata Mark Schiebel. Outline I.Brief Cellular Automata Background II.Tic-Tac Au-Toe-Mata Rules III.Project Design IV.Computer Strategy V.Conclusion.

Chess: Shootmenow Edition By: Sean Sprigg and Tom Samaras.

Application of Artificial intelligence to Chess Playing Capstone Design Project 2004 Jason Cook Bitboards  Bitboards are 64 bit unsigned integers, with.

Chinese Chess 象棋 xìang qí. History Evolved from another game: Liubo, which was invented about 3500 years ago Xiangqi emerged around the Tang dynasty (at.

The Implementation of Artificial Intelligence and Temporal Difference Learning Algorithms in a Computerized Chess Programme By James Mannion Computer Systems.

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

By Joseph Tanti FIDE Instructor. Some completely different ways to play chess.

 The amount of time it takes a computer to solve a particular problem depends on:  The hardware capabilities of the computer  The efficiency of the.

This time: Outline Game playing The minimax algorithm

How Computers Play Chess Peter Barnum November 15, 2007 Artificial Intelligence 101.

November 10, 2009Introduction to Cognitive Science Lecture 17: Game-Playing Algorithms 1 Decision Trees Many classes of problems can be formalized as search.

UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.6: Adversarial Search Fall 2008 Marco Valtorta.

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.

Fundamentals of Computing 2 Final Project Idiot A.I. Chess.

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.

The Final Move! By Jonathan Leonor. Daniel is in a tough situation because he only has one move left to checkmate his opponent other wise it will be a.

Expertise and creativity What makes experts different than novices? –Usually, we talk about mental tasks (e.g., playing chess, being an accountant) Possible.

NDopoly! Group Members: Jason Lacher Matthew Fallon Project: “NDopoly” a Notre Dame version of the board game Monopoly tm.

Hex Combinatorial Search in Game Strategy by Brandon Risberg May 2006Menlo School.

PSU CS 370 – Introduction to Artificial Intelligence Game MinMax Alpha-Beta.

Game Rules Rules define game objects and define allowable actions by the players.

Game Rules Rules define game objects and define allowable actions by the players.

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

Prepared by : Walaa Maqdasawi Razan Jararah Supervised by: Dr. Aladdin Masri.

October 3, 2012Introduction to Artificial Intelligence Lecture 9: Two-Player Games 1 Iterative Deepening A* Algorithm A* has memory demands that increase.

The Generic Gaming Engine Andrew Burke Advisor: Prof. Aaron Cass Abstract Games have long been a source of fascination. Their inherent complexity has challenged.

Introduction to Artificial Intelligence CS 438 Spring 2008 Today –AIMA, Ch. 6 –Adversarial Search Thursday –AIMA, Ch. 6 –More Adversarial Search The “Luke.

Instructor: Vincent Conitzer

Application of Artificial Intelligence to Chess Playing Jason Cook Capstone Project.

Planning to Guide Opening and Middle Game Play in Shogi Reijer Grimbergen (Electrotechnical Laboratory) Hitoshi Matsubara (Future University Hakodate)

1 CS 4701 – Project Proposal Jane Park (jp624) Ran Zhao (rz54)

Chapter 17 THE FUTURE OF BUSINESS Gitman & McDaniel 5 th Edition THE FUTURE OF BUSINESS Gitman & McDaniel 5 th Edition Chapter Using Technology to Manage.

$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.

Network Bridge Richard Bowman Elitza Maneva Leah Fox.

Artificial intelligence

DEEP RED An Intelligent Approach to Chinese Checkers.

Chess By Kyle Fischer. What is chess? Chess is a game that you try to get the other person’s king in a checkmate.

Rules Of Chess!!!!!! By: Caylin Stappenbeck. Table Of Contents!!!! Rules*** Conclusion***

Each piece is represented by a symbol. The pieces all stand in the same position at the start of the game the pieces are the Rook, the Knight, the Bishop,

The Implementation of Artificial Intelligence and Temporal Difference Learning Algorithms in a Computerized Chess Program By James Mannion Computer Systems.

CSE467S Project Proposal Board Game via TelosB / Tmote Sky Esteban Cabrera Zeddy Chirombe David Houngninou.

Artificial WINtelligence By: Jamaal Alleyne, C. Barrett Ames, Daniel Sullivan.

Prometheusaurus Final Demo Team Software Project Group #1 Fall 2012 Steve Danowitz, Kelly Helhowski, Emily Christ, Corbin Uselton, Chris Leer, and Briana.

Artificial Intelligence, simulation and modelling.

Carcassonne Expert Game1 Carcassonne Java Jess Expert Game Intelligent Board Games and Query-Based Utility Reasoning René Molenaar, Ludo Maat.

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

London Chess Conference 2015 Chess and Society Chess and Football Rob Willmoth

The Game Development Process: Artificial Intelligence.

By James Mannion Computer Systems Lab Period 3

Electronic health record (EHR) software selection and purchase

Software Development CMSC 202.

Heuristic AI for XiangQi

Learn to ask a clear and specific question.

Android App Developing with communication included

Quick Checkmates & Stopping Them

Screenshot: PowerMad in Action

Treasure Chess ECE 477 Team 2 Brock Caley.

Electronic health record (EHR) software selection and purchase

Instructor: Vincent Conitzer

Symbols for the Pieces Presentation 03

David Liepmann Professor Cass, Advising

Quick Checkmates & Stopping Them

Jeff Hebrank Jason Radabaugh

Presentation transcript:

Jiang Zun Herbert Lee CS 491 August 28, 2006

What is Jiang Zun? ● Jiang Zun is an electronic Chinese Chess client.  Chinese Chess, or Xiang Qi, is a two-player board game similar to Western Chess.  The name Jiang Zun comes from the Chinese term for checkmate.

Xiang Qi ● Pieces are placed on the lines, rather than between them. ● Most Chess pieces have an analogous piece in Xiang Qi. ● The goal of the game is the same as Western Chess.

Why Xiang Qi? ● Lack of computerized Xiang Qi resources ● Interest in the game ● Artificial intelligence

Implementation ● Java 2 SE 5.0  Selected for ease of GUI implementation ● Five Main Classes  Board  GamePanel  Piece  AiPlayer  Game

What I've Learned ● Java GUI ● Development Process ● Artificial Intelligence

Application Analysis ● Hot-seat games functional ● Capable of defeating novice players ● Decision making process too slow  Can take upwards of 10 seconds to make a move ● Decisions made are suboptimal  Initial move very poor  Does not handle fork situations well

What Would Need Work ● Online Capability ● UI improvements ● Artificial intelligence overhaul ● Game state evaluation function re-working