Find how to get to the exact position!

5 moves.

4*******

yeah thats correct

This is commonly called a "shortest proof game" or SPG. The rules on those are very strict. All moves must be played in one particular order and switching of moves is not allowed. Your construction permits starting with 1. f3 or 1. e4 so it's not yet a valid SPG with just 1 solution.

SPGs are one of the most popular branches of the retrograde field. The simpler ones can also be generated by computer programs like the Sudoku puzzles.

BANANA

Position after 6 moves. What was the exact game?

I have no idea

some random knight and king moves

It's not hard - it's the continuation of your diagram on the other wing and a few different moves. But the idea is the same!

Well done! I have seen a similar SPG before but I couldn't quite remember it so I had to construct my own version. Making SPGs is an enjoyable activity as it levels the playing field. You need not be an accomplished chessplayer to find something nice!

5 moves.

yeah thats right answer

I know it is least 100 moves long since a friend of mine made one after a concept by Andrei Frolkin. If I recall well it featured 14 rooks. However, I am not a knowledgeable librarian. The record may be higher by now.

The record for a UNIQUE proof game is 57.5 moves long. See it here:  https://pdb.dieschwalbe.de/P0000136

And the record for the longest NON-UNIQUE proof game is 185 moves moves,. It is by Harry Goldsteen and from the last entry in Tim Krabbe's Diary:https://timkr.home.xs4all.nl/chess2/diary.htm

Ah yes, the 1st one looks like the one I referred to. My memory said it was over 100 moves but they may have been single moves - not full moves. Harry Goldsteen found an error in its predecessor after which it might have been updated.

Harry once showed me the solution to the last one. By the time he was finished my beard had doubled in size

ya it wasnt intentiona32lewdsxbhfwkdscx

How to reach here?