I output the input line in via std :: cout << maze

And you forgot to separate each output so what you see is multiple mazes concatenating to each other.

I'm sorry to say this, but if you're making newbie mistakes like this and can't realize the mistake at all, maybe you still need to work a lot harder before attempting this kata ;-)

Because you're not interpreting the logs correctly?

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.............

Yeah I read that. Is (0, 0) at the top left or bottom left?

Isn't (N-1, N-1) the W at the center in the above example?

Sorry I can't seem to figure out what I'm missing :)

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.

the line has no solution

And how do you know that? Are you sure you're interpreting the messages correctly? Specially for you, just to be 200% sure I've looked through the "snake" cases, and they are all correct.

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).

your test says that there is a way out of this labyrinth, but according to the logs it is not

What logs? This is a valid test.

.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.