91 lines
2.7 KiB
Markdown
91 lines
2.7 KiB
Markdown
[< Back](../README.md)
|
|
|
|
# Exercise: PacMan AI
|
|
|
|
Let's implement a naive AI for PacMan.
|
|
|
|
## Background: PacMan Moves
|
|
|
|
At each intersection, check if there is a ghost directly inline with that path. If the path is free of ghosts, you are
|
|
allowed to turn there. And if PacMan is moving in a direction, and a ghost enters his path, then PacMan will reverse.
|
|
|
|
For example if PacMan is at an intersection and can go either right or up, and there is a ghost in the path going right,
|
|
then PacMan will go up. Then while PacMan is going up, a ghost enters that path, PacMan will go back.
|
|
|
|
You only need to worry about the grid itself and any ghosts on the North/South/East/West axis of PacMan.
|
|
|
|
## Exercise
|
|
|
|
### Part 1
|
|
|
|
Implement [PacManAI::pelletClosestToPacman](../../../lib/PacManAI.cpp) and test your implementation with the test
|
|
in [testPacmanAI.cpp](../../../test/testPacmanAI.cpp) called _"Find pellet closest to PacMan"_
|
|
|
|
The function should return the position of the pellet that is "closest" to PacMan. One implementation could be to sort
|
|
the vector of pellets by the distance they have to PacMan, and then return the first one.
|
|
|
|
```cpp
|
|
GridPosition PacManAI::pelletClosestToPacman(GridPosition pacmanGridPosition,
|
|
std::vector<GridPosition> & pellets) {
|
|
return {0, 0};
|
|
}
|
|
```
|
|
|
|
<details>
|
|
<summary>Hint 1</summary>
|
|
|
|
Use the `positionDistance` function to find the distance to PacMan.
|
|
|
|
</details>
|
|
<details>
|
|
<summary>Hint 2</summary>
|
|
|
|
Use the [std::sort](https://en.cppreference.com/w/cpp/algorithm/sort) function to sort the vector.
|
|
|
|
</details>
|
|
|
|
</details>
|
|
<details>
|
|
<summary>Hint 3</summary>
|
|
|
|
[std::sort](https://en.cppreference.com/w/cpp/algorithm/sort) third parameter should be a lambda taking 2 `GridPosition` as parameter,
|
|
and return true if the first parameter is closer from PacMan than the second.
|
|
|
|
</details>
|
|
|
|
### Part 2
|
|
|
|
Implement [PacManAI::isValidMove](../../../lib/PacManAI.cpp) and test your implementation with the test
|
|
in [testPacmanAI.cpp](../../../test/testPacmanAI.cpp) called _"Is valid move"_
|
|
|
|
```cpp
|
|
bool PacManAI::isValidMove(const Move & move) {
|
|
return false;
|
|
}
|
|
```
|
|
|
|
<details>
|
|
<summary>Hint</summary>
|
|
Use isWalkableForPacMan in Board.cpp to make sure PacMan is not walking in ways that are not legal
|
|
|
|
</details>
|
|
|
|
### Part 3
|
|
|
|
Implement [PacManAI::optimalDirection](../../../lib/PacManAI.cpp) and test your implementation with the test
|
|
in [testPacmanAI.cpp](../../../test/testPacmanAI.cpp) called _"Is optimal direction"_
|
|
|
|
```cpp
|
|
Direction PacManAI::optimalDirection(const std::array<Move, 4> & moves) {
|
|
return Direction::NONE;
|
|
}
|
|
```
|
|
|
|
<details>
|
|
<summary>Hint</summary>
|
|
You can use std::min_element to find the closest pellet
|
|
|
|
</details>
|
|
|
|
|