1 / 12

Games Special-Session SIGCSE-03

Games Special-Session SIGCSE-03. David Ginat Tel-Aviv University. Laser War. Matrix M  N, Robots – Red , Blue Each move - horizontal / vertical Fire-lines - horizontal & vertical Crossing of fire-line – game ends. Laser War.

rowa
Download Presentation

Games Special-Session SIGCSE-03

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. Games Special-Session SIGCSE-03 David Ginat Tel-Aviv University

  2. Laser War Matrix MN, Robots – Red,Blue Each move - horizontal / vertical Fire-lines - horizontal & vertical Crossing of fire-line – game ends

  3. Laser War 1. Backtrackingthrough all the possible game scenarios 2. Dynamic Programming – up to (M-1)(N-1) different-size rectangles between the robots

  4. Laser War Look for a playing strategy, by simplification

  5. Laser War Invariant property: Horiz-distance = Vert-distance

  6. Laser War Two rooms, concurrently

  7. Wyt Rooks Each player chooses a rook and moves it any number of vertical xor horizontal spaces toward the X. Last to move wins (normal form).

  8. Pawn on a Board Each player moves the pawn, horizontally or vertically, to an adjacent square, which was not-yet-visited. Last to move wins (normal form).

  9. Pawn on a Board Invariant + Auxiliary coloring

  10. Multiple by 2..9 Starting at N=1, two players multiply N by one of the integers 2,3,…,9, in alternating turns. Free choice of one of these integers in each turn. The first to cross 1000 wins. Example: 1 5  45 90  270

  11. Multiple by 2..9 Backward reasoning: 1000+ 112 – 999 56 – 111 7 – 55 4 – 6 1

  12. Application in Class Motivate, Illustrate, Exercise: - Invariance - Design techniques, recursion - Auxiliary elements - Lookup table, pre-processing - Mathematical patterns - Problem solving heuristics

More Related