des/pacman
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

Push things so Patricia can fix the headers and stuffs

Browse source
This commit is contained in:
cor3ntin 2021-10-05 16:10:24 +02:00 committed by GitHub
parent 5fa007f267
commit c9b8277d8f
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 28 additions and 10 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

38
exercises/25/pacman_ai/README.md
View file

@ -22,9 +22,6 @@ You only need to worry about the grid itself and any ghosts on the North/South/E
The function should return the position of the pellet that is "closest" to PacMan. One implementation could be 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. to sort the vector of pellets by the distance they have to PacMan, and then return the first one.
*Hint 1*: use the `positionDistance` function to find the distance to PacMan
*Hint 2*: use the [std::sort](https://en.cppreference.com/w/cpp/algorithm/sort) function to sort the vector
```cpp ```cpp
GridPosition PacManAI::pelletClosestToPacman(GridPosition pacmanGridPosition, GridPosition PacManAI::pelletClosestToPacman(GridPosition pacmanGridPosition,
std::vector<GridPosition> & pellets) { std::vector<GridPosition> & pellets) {
@ -32,24 +29,45 @@ GridPosition PacManAI::pelletClosestToPacman(GridPosition pacmanGridPosition,
} }
``` ```
<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>
2. Implement [PacManAI::isValidMove](../../../lib/PacManAI.cpp) and test your implementation with the test 2. Implement [PacManAI::isValidMove](../../../lib/PacManAI.cpp) and test your implementation with the test
in [testPacmanAI.cpp](../../../test/testPacmanAI.cpp) called _"Is valid move"_ in [testPacmanAI.cpp](../../../test/testPacmanAI.cpp) called _"Is valid move"_
*Hint*:
```cpp ```cpp
bool PacManAI::isValidMove(const Move & move) { bool PacManAI::isValidMove(const Move & move) {
return false; return false;
} }
``` ```
<details>
<summary>Hint</summary>
</details>
3. Implement [PacManAI::optimalDirection](../../../lib/PacManAI.cpp) and test your implementation with the test 3. Implement [PacManAI::optimalDirection](../../../lib/PacManAI.cpp) and test your implementation with the test
in [testPacmanAI.cpp](../../../test/testPacmanAI.cpp) called _"Is optimal direction"_ in [testPacmanAI.cpp](../../../test/testPacmanAI.cpp) called _"Is optimal direction"_
*Hint*:
```cpp ```cpp
Direction PacManAI::optimalDirection(const std::array<Move, 4> & moves) { Direction PacManAI::optimalDirection(const std::array<Move, 4> & moves) {
return Direction::NONE; return Direction::NONE;
} }
``` ```
<details>
<summary>Hint</summary>
</details>