Hopefully, later, the contents will include some theory of why a particular vectorial representation is used on the Maple sheet in the Notes, as well as procedures that move stick between states. Perhaps even an algorithm that implements efficient tree search to minimize moving cost, related to Linear Transformations. Check back a little later.
The object of the puzzle is to move as little as many possible sticks to change the above to PIE. Think about it for a while, before checking this Quora question and answer. After you read the answer, construct similar ones and try to see how you do using the program in the Notes.Notes