As we know that white starts the game of chess. Can you find the scenario shown in the picture below is possible when all the white pieces are at the original place while the black pawn is not as in the below picture?
Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?