https://github.com/tangruize/ai-assignment

AI course 2018 Assignment.
https://github.com/tangruize/ai-assignment

Last synced: 3 months ago
JSON representation

AI course 2018 Assignment.

• Host: GitHub
• URL: https://github.com/tangruize/ai-assignment
• Owner: tangruize
• Created: 2018-03-25T13:52:15.000Z (about 7 years ago)
• Default Branch: master
• Last Pushed: 2018-03-26T07:00:05.000Z (about 7 years ago)
• Last Synced: 2025-01-07T20:42:07.961Z (5 months ago)
• Language: Java
• Size: 2.2 MB
• Stars: 1
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Description

AI homework.

## Assignment 1

gvgai-bait: https://github.com/EssexUniversityMCTS/gvgai 

### Task 1: Depth First Search

Description: Use DFS. No depth and time limit.

|         | Win/Lose | Score | Time Step |

|---------|----------|-------|-----------|

| Level 0 | Win      | 5     | 9         |

| Level 1 | Win      | 7     | 98        |

| Level 2 | Win      | 11    | 261       |

| Level 3 | Lose     | 0     | 1000      |

| Level 4 | Win      | 11    | 61        |

| Summary | 4:1      | 34    | 429       |

### Task 2: Heuristic Depth Limited Search

Description: Use a heuristic function to guide avatar. It has to make a decision when time is up.

|         | Win/Lose | Score | Time Step |

|---------|----------|-------|-----------|

| Level 0 | Win      | 5     | 9         |

| Level 1 | Win      | 7     | 205       |

| Level 2 | Win      | 7     | 124       |

| Level 3 | Lose     | 0     | 1000      |

| Level 4 | Win      | 11    | 549       |

| Summary | 4:1      | 30    | 887       |

### Task 3: A* Search

Description: f = g + h. It has to make a decision when time is up.

|         | Win/Lose | Score | Time Step |

|---------|----------|-------|-----------|

| Level 0 | Win      | 5     | 9         |

| Level 1 | Win      | 7     | 38        |

| Level 2 | Win      | 11    | 155       |

| Level 3 | Lose     | 7     | 1000      |

| Level 4 | Win      | 11    | 72        |

| Summary | 4:1      | 41    | 274       |

### Records

Algoritm: DFS, DLS and A\* respectively.

Level 0:

![DFS Level 0](assignment1/ScreenRecord/DFS/0.gif)

![DLS Level 0](assignment1/ScreenRecord/DLS/0.gif)

![AStar Level 0](assignment1/ScreenRecord/AStar/0.gif)

Level 1:

![DFS Level 1](assignment1/ScreenRecord/DFS/1.gif)

![DLS Level 1](assignment1/ScreenRecord/DLS/1.gif)

![AStar Level 1](assignment1/ScreenRecord/AStar/1.gif)

Level 2:

![DFS Level 2](assignment1/ScreenRecord/DFS/2.gif)

![DLS Level 2](assignment1/ScreenRecord/DLS/2.gif)

![AStar Level 2](assignment1/ScreenRecord/AStar/2.gif)

Level 3:

![DFS Level 3](assignment1/ScreenRecord/DFS/3.gif)

![DLS Level 3](assignment1/ScreenRecord/DLS/3.gif)

![AStar Level 3](assignment1/ScreenRecord/AStar/3.gif)

Level 4:

![DFS Level 4](assignment1/ScreenRecord/DFS/4.gif)

![DLS Level 4](assignment1/ScreenRecord/DLS/4.gif)

![AStar Level 4](assignment1/ScreenRecord/AStar/4.gif)