1 / 7

Domain of chess problem

Domain of chess problem. 2000-12167 이강산. What is chess?. Mental play Sequence of action which has Goal Rule Time limit Good chess play can be defined easily Play to win Play not to violate the rule Play can be completed within suitable time. Is it hard to play?. Easy just to play

elnora
Download Presentation

Domain of chess problem

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Domain of chess problem 2000-12167 이강산

  2. What is chess? • Mental play • Sequence of action which has • Goal • Rule • Time limit • Good chess play can be defined easily • Play to win • Play not to violate the rule • Play can be completed within suitable time

  3. Is it hard to play? • Easy just to play • Not so easy to win • Better the opponent is at chess, Harder I win • Very, very hard to win the champion • Extremely hard to win always • With infinite amount of time, it’s possible

  4. What do I need to win? STRATEGY

  5. Strategy • Compute all possible moves • Important to win local battles • One game usually takes 30 moves • One position usually takes 8 possible actions • Number of cases: 1237940039285380274899124224 1237자 9400해 3928경 5380조 2748억 9912만 4224 Computing 1000000000(10억) moves per sec -> 1237940039285380274 secs -> 343872233134827 hours -> 14328009713951 days -> 39254821134 years -> 392억 5482만 1134년 • Cannot win all the time with computing moves strategy because it’s impossible to compute completely

  6. Strategy • Find patterns • Ability to find shortcuts to favorable states • No deterministic algorithm • All patterns or heuristics have a weak-point • A wins B, B wins C, C wins A

  7. Computing vs Intuition • Both are essential to win • Computers are good computing, of course • Computing speed is enumerous • Human • Good at recognize patterns, find heuristic No need to iterate – can see the way straightly • Recent Match • Computer win when human failed to read positions • Human win when computer failed to recognize long-term purpose of moves • But winning the chess doesn’t mean to be intelligent, It’s nothing but computing, and still closed. There is a computer-buster !!!

More Related