I can not understand the logic of the tests, why if I change in the function:

bool path_finder(string maze) { return false; }

on:

bool path_finder(string maze) { return true; }

string maze changes from:

.W...W...W...\n.W.W.W.W.W.W.\n.W.W.W.W.W.W.\n.W.W.W.W.W.W.\n.W.W.W.W.W.W.\n.W.W.W.W.W.W.\n.W.W.W.W.W.W.\n.W.W.W.W.W.W.\n.W.W.W.W.W.W.\n.W.W.W.W.W.W.\n.W.W.W.W.W.W.\n.W.W.W.W.W.W.\n...W...W...W.

on:

.W...W...W...\n.W.W.W.W.W.W.\n.W.W.W.W.W.W.\n.W.W.W.W.W.W.\n.W.W.W.W.W.W.\n.W.W.W.W.W.W.\n.W.W.W.W.W.W.\n.W.W.W.W.W.W.\n.W.W.W.W.W.W.\n.W.W.W.W.W.W.\n.W.W.W.W.W.W.\n.W.W.W.W.W.W.\n...W...W...W..............\nWWWWWWWWWWWW.\n.............\n.WWWWWWWWWWWW\n.............\nWWWWWWWWWWWW.\n......W......\n.WWWWWWWWWWWW\n.............\nWWWWWWWWWWWW.\n.............\n.WWWWWWWWWWWW\n.............

An example of the input line above, my code says that there is no way out of the maze, but the test says that there is a way out. I can provide my code for analysis so that you can verify that the string is interpreted correctly.

I output the input line in via "std :: cout << maze" to analyze my mistakes, the line has no solution (false), but the test says that you can reach the end of the maze (true).

.W...W...W...\n
.W.W.W.W.W.W.\n
.W.W.W.W.W.W.\n
.W.W.W.W.W.W.\n
.W.W.W.W.W.W.\n
.W.W.W.W.W.W.\n
.W.W.W.W.W.W.\n
.W.W.W.W.W.W.\n
.W.W.W.W.W.W.\n
.W.W.W.W.W.W.\n
.W.W.W.W.W.W.\n
.W.W.W.W.W.W.\n
...W...W...W..............\n
WWWWWWWWWWWW.\n
.............\n
.WWWWWWWWWWWW\n
.............\n
WWWWWWWWWWWW.\n
......W......\n
.WWWWWWWWWWWW\n
.............\n
WWWWWWWWWWWW.\n
.............\n
.WWWWWWWWWWWW\n
..........................\n
WWWWWWWWWWWW.\n
.............\n
.WWWWWWWWWWWW\n
.............\n
WWWWWWWWWWWW.\n
.............\n
.WWWWWWWWWWWW\n
.............\n
WWWWWWWWWWWW.\n
.............\n
.WWWWWWWWWWWW\n
.............

I solve kata on c ++, your test says that there is a way out of this labyrinth, but according to the logs it is not. Comment on this case if this is a task error or mine tell me what to do next.