Thoughts Concerning the King+Rook_vs_Rook Problem

Slides:



Advertisements
Similar presentations
Heuristic Search techniques
Advertisements

NEURAL NETWORKS Perceptron
Solve for x. 28 = 4(2x + 1) = 8x = 8x + 8 – 8 – 8 20 = 8x = x Distribute Combine Subtract Divide.
CPSC 322, Lecture 14Slide 1 Local Search Computer Science cpsc322, Lecture 14 (Textbook Chpt 4.8) February, 4, 2009.
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.
1 Anna Östlin Pagh and Rasmus Pagh IT University of Copenhagen Advanced Database Technology March 25, 2004 QUERY COMPILATION II Lecture based on [GUW,
Concerns-Based Adoption Model (CBAM)
16.5 Introduction to Cost- based plan selection Amith KC Student Id: 109.
Complete and Present Prototype Project 6 Status report: Tuesday, October 5 th Due: Saturday, October 9 th Presentation: Tuesday, October 12 th.
New Mexico Computer Science For All Introduction to Algorithms Maureen Psaila-Dombrowski.
1 Focusing on the FCAT/FCAT 2.0 Test-Taking Strategies Grades 3-5 Nancy E. Brito, Department of Assessment , PX47521.
Test Preparation Strategies
1 Focusing on the FCAT/FCAT 2.0 Test-Taking Strategies Grades 9-11 Nancy E. Brito, Department of Assessment , PX47521.
ACT Test Prep College Bound Test Prep. Overview  The test is about three hours long (three and a half with the Writing test.)  It consists of 215 scored.
HOW TO SOLVE IT? Algorithms. An Algorithm An algorithm is any well-defined (computational) procedure that takes some value, or set of values, as input.
Game Playing.
1 Focusing on the FCAT Test-Taking Strategies Grades 3-5 Nancy E. Brito, Department of Assessment , PX47521 Information.
1 Psych 5500/6500 Populations, Samples, Sampling Procedures, and Bias Fall, 2008.
Introduction to search Chapter 3. Why study search? §Search is a basis for all AI l search proposed as the basis of intelligence l inference l all learning.
Written Addition – Objectives
1 CPSC 320: Intermediate Algorithm Design and Analysis July 28, 2014.
Making Decisions uCode: October Review What are the differences between: o BlueJ o Java Computer objects represent some thing or idea in the real.
Christopher Moh 2005 Competition Programming Analyzing and Solving problems.
By: Lokman Chan Recursive Algorithm Recursion Definition: A function that is define in terms of itself. Goal: Reduce the solution to.
1 Process Stability Training. Objective Objective: By the end of this lesson, you will be able to use two Process Stability tools for the purpose of determining.
Santa’s s By Jack Carr. Sending an attachment to Santa Explain how you attached the . New message, insert, attachment Explain why you.
OCR Diploma Level 2 Unit 2 Maintaining effective working relationships with colleagues and customers.
Sorting: Implementation Fundamental Data Structures and Algorithms Klaus Sutner February 24, 2004.
HKOI Programming HKOI Training Team (Intermediate) Alan, Tam Siu Lung Unu, Tse Chi Yung.
Fall 2001(c)opyright Brent M. Dingle 2001 Simple Sorting Brent M. Dingle Texas A&M University Chapter 10 – Section 1 (and some from Mastering Turbo Pascal.
1 Focusing on the FCAT Test-Taking Strategies Grades 6-8 Nancy E. Brito, Department of Assessment , PX47521
1 Focusing on the FCAT Test-Taking Strategies Grades 9-11 Nancy E. Brito, Department of Assessment , PX47521
Key Stage 2 SATs Information and Guidance on the Changes and Expectations for 2015/16 Streatley C of E Primary School Thursday 25th February 2016.
Christoph F. Eick: Thoughts on the Rook Project Challenges of Playing Bridge Well 
CS4432: Database Systems II
Christoph F. Eick: Thoughts on Designing Michigan-style Classifier Systems Thoughts on Selection Methods in Michigan-style Classifier Systems  When solving.
Move Generators and Other Basic Functions for the WRKBK Problem
Advanced Higher Computing Science
Chapter 13! One Brick At A Time!.
JavaScript/ App Lab Programming:
PeerWise Student Instructions
AP CSP: The Need for Programming Languages and Algorithms
SAT Prep Lesson # 1 EQ: What do I need know about time management to be successful on the SAT?
IGCSE 6 Cambridge Effectiveness of algorithms Computer Science
What Helped Dana in physics go from a 54 exam score to a 91, and end up with a 90 on the final? Dana’s Problem: She used the example problems in the book.
Java 4/4/2017 Recursion.
For Monday Chapter 6 Homework: Chapter 3, exercise 7.
Lecture 10.
CMSC201 Computer Science I for Majors Lecture 11 – Program Design
C ODEBREAKER Class discussion.
Tips for tenderers Liz Frizi: Head of Procurement
TEST taking strategies
ELT. General Supervision
English Language Development Assessment (ELDA)
exa.im/stempy16.files - Session 12 Python Camp
Evaluation of Mobile Interfaces
Video 6: Practice Papers for
Looping and Random Numbers
Guide to the Short Answer Question
Edward de Bono’s Six Thinking Hats
Recurrences (Method 4) Alexandra Stefan.
GCSE Revision In response to a large number of Y11 students asking for advice on how to revise….. Introduction & revision planning Revision techniques.
Lecture 6 Architecture Algorithm Defin ition. Algorithm 1stDefinition: Sequence of steps that can be taken to solve a problem 2ndDefinition: The step.
Metacognition Parent Workshop
Algebra 1 10/17/16 EQ: How do I solve 2 and multi step inequalities?
Local Search Algorithms
I believe the reason students have difficulty learning algebra and that most people have trouble doing math word problems is that although children are.
Games & Adversarial Search
CMSC201 Computer Science I for Majors Lecture 12 – Program Design
A strategy to help you learn for the long term
Presentation transcript:

Thoughts Concerning the King+Rook_vs_Rook Problem The task is to solve the problem at hand Hill-Climbing, Randomized Hill Climbing, Backtracking, Best-first Search,… all seem to be suitable search strategies for the problem Find “good” evaluation functions” (e.g. f(pos)=king_close_w_king(pos)*a + king_close_to_rook(pos)*b + c*1/Freedom_black_king(pos)) for one of the available search strategies Rapid prototyping is strongly recommended; also don’t make things too complicated at the beginning Try to learn from sample runs Idea: break the problem into sub-problems and solve each sub-problem separately. Idea: Reduce the search space by disallowing certain moves Idea: Use look-ahead when you use backtracking or hill climbing You are allowed to take advantage of the face that “you know in advance how the black king moves”. It is okay if you implement a game-style system but you should be aware of the fact that you are trying to solve a more complicated problem which makes it much harder to get your system running. “Complex” search strategies are frequently hard to debug/improve.

Thoughts Concerning the King+Rook_vs_Rook Problem (cont.) Instead of looking to all possible positions sample some of those to reduce the complexity of the search Checking for duplicate states might or might not help (this answer is dependent on the employed search strategy) Disjunctive goals in search create problems Taking advantage of symmetry is complicated, but might help! You will receive a file consisting of 12 additional test cases no later than February 21, 2008. There will be also a demo where your program will be run for 10 test cases that are somewhat similar to the ten training test cases. Test cases will be sorted by difficulty; if you program cannot solve all the test problems this is not the end of the world; however, if it is not able to solve the “simple” cases you will not get a good grade for project. The primary goal is to checkmate the black king; however, programs that find shorter solutions will get higher scores. The project will be graded evaluating your report, the quality of the designed program, and the programs performance for the training and test set. Program performance for test cases will count at least 55% for the overall grade.