for this kata :

• PacMan cannot revisit cells where he already went;
• Walls and Empty spaces ('W's and 'E's) are effectively the same, PacMan cannot go on these

The task is: To find a path that it's starts from the position of "P", and go through all of "D"s. The path should not contain duplicate positions and empty positions.
Is this clear?

hey! I'm trying to understand the requirements. This is example map 5 and it doesn't have a solution:

["D","D","D"],
["E","P","E"],
["E","E","E"]

Does it mean that it can't go to Empty places? In this case E acts the same way as W, so what is the difference between them?

Also...pacman should be able to go back and forth, is that not the case?

Overcomplicated!