A one player game is played on the triangular board shown on the picture. A token is placed on each circle. Each token is white on one side and black on the other. Initially, the token at one vertex of the triangle has the black side up, while the others have the white sides up. A move consists of removing a token with the black side up and turning over the adjacent tokens (two tokens are adjacent if they are joined by a segment). Is it possible to remove all the tokens by a sequence of moves?
https://cdn.artofproblemsolving.com/attachments/d/2/aabf82a0ddd6907482f27e6e0f1e1b56cd931d.png