Workshops for Artificial Intelligence 1 (Winter 2015/16)

This page contains materials for the practice lessons of the Artificial Intelligence 1 (NAIL069) course that is/has been taught during winter term of 2015/2016 at Charles University in Prague, Czech Republic. The course is/was lead by Roman Barták. Workshops are/were backed up by Jakub Gemrot (gemrot@gamedev.cuni.cz).

Dates

Monday’s workshops, 17:20, SU1

Tuesday’s workshops, 15:40, SU2

How to pass the practice

We have a credit system here. You can have credits for: homeworks (extra credits for meeting deadlines) and tournaments. Tournament points are not necessary to pass the practice, credits from homeworks are.

Study following Excel tables (it has multiple sheets!) that gives you an overview what is ahead of you.

Tournaments

Mario AI

MarioAI tournament is over! Congratulations goes to Michal Mojzik who managed to create a bot with 100% successful rate (believe it or not ;-). Check all results here or just download excel sheet with aggregated numbers.

PacMan AI

PacMan tournament is over! Congratulations goes to Tomáš Procházka who managed to steal the victory! Check all results here or just download excel sheet with aggregated numbers.

Workshops

Workshop 06

  • Create a bot for the Conquest! game!
  • Grab the code here: https://github.com/kefik/conquest-engine-gui/
  • Check the AggressiveBot for hints how the API works
  • Be sure to submit a bot that is better than AggressiveBot, good luck!

Workshop 05

  • Conquest! A Risk-like game for two players that fight over the world domination!
  • Grab the code here: https://github.com/kefik/conquest-engine-gui/
  • Check the AggressiveBot for hints how the API works
  • Get in touch with FightSimulation and the way how to use it

Workshop 04

  • Playing with search heuristic. Can you find one that will allow you to eat all pills within the maze as fast as possible? Oh and watch out for the ghost!
  • Homework:
    • Implement search that will let Ms Pac-Man to eat all pills within the maze as fast as possible
    • You do not need to use the code from the GitHub
    • If you wish to sign up for the Ms Pac-Man tournament with your code, submit it till 28.12.2015 23:59

Workshop 03

  • Slides: PPTX, PDF
  • Ms Pac-Man time! We are going to implement basic path-finding algorithms (and visualize them doing so!)
  • Homework:
    • Implement informed A-Star graph-search algorithm
    • Hack IGraphView into A-Star
    • Provide random navigation around the maze for Ms Pac-Man

Workshop 02

  • Slides: PPTX, PDF
  • Ms Pac-Man time! We are going to implement basic path-finding algorithms (and visualize them doing so!)
  • Homework:
    • Implement a “graph builder” that contract Maze into smaller Graph
    • Implement DFS, BFS and UCS uninformed graph-search algorithms

Workshop 01

  • Slides: PPTX, PDF
  • Super-Mario time! We are going to code reflexive agent for a Super-Mario game!
  • You might want to check out how to import Java projects into Eclipse
  • Homework:
    • Create a reflexive agent for Super-Mario that is able to beat 2 out of 5 random (easy) levels

 

Leave a Reply

Your email address will not be published. Required fields are marked *