Now it makes sense.

@KacperKoban can you give an answer to this question that is not hidden(spoiler)

In python i get: 'abcdetsrifabcde' should equal 'abcde<reversed object at 0x7f9e29769b90>abcde', you should wrap reversed object in a list.

I get RuntimeError: maximum recursion depth exceeded in comparison in python because n is 800

python translation :)

i gave up. the solution is too complex.

I changed desc.:

In starting positions pawns will be separated by at least 3 ranks
into
In starting positions most advanced pawns from either side will be separated by at least 2 ranks

this will make it irelevant if two-square pawn moves and en passant are or are not allowed.

Third is also not a problem with best play from both sides

because this is a white pawn ASCII:♟ and this is a black pawn ASCII:♙.
They are very similar, especially if they are next to each other like in desc.
But if you put those ASCII images in notepad++ you get completely different images.

I added as much randomness as possible given that there are only 2 files. now your hack only works 25% of the time, and i don't think there is another position with 2 files that i can add. There simply are no more ways to position pawns on 2 files(i.e.:one pawn on one file, 2 pawns on 2 separate files, 2 pawns on same file -- and those same combinations for other player)

with a 2 file board its pretty easy to cheat instead of thinking about the problem, so if people want to do that i can't stop them unless i add chess engine to check random solutions. And even with a chess engine and random solutions algorithm remains the same because pawn on 8 and 80 rank in starting poition is the same thing