I'm playing a game (see here), and in it is a puzzle, which I've made a TIKZ graph seen below for illustration:
$\hspace{2.5cm}$
There is one player. The player ($\mathscr{L}$) moves from node to node limited by the directed arrows. As the player moves, $\mathscr{G}_{\Huge\cdot}$ chooses to move in the opposite direction while $\mathscr{G}_{\circ}$ moves in the same direction as the player, all three step simultaneously. If the player makes a move that would cause the guardians to jump off the playing board they remain in place, and the player keeps his/her move. Also, if the player makes a move that would cause him/her to jump off the playing board, then he/she remains in place. The object of the game is to guide the guardians to the circle-cross ($\bigoplus$) nodes so that they individually land on each in whatever order and whatever way simultaneously (see linked video for clarity). A 12-step solution to solve the puzzle has been uncovered, however, I am seeking the shortest possible step solution to this puzzle.
Special rules:
Game ends if above move is performed.
Guardians remain in place and player keeps his/her move.
Game ends if above move is performed.
$(\mathscr{L}\rightarrow\mathscr{G_\circ}\rightarrow\circ)$ OR $(\mathscr{G_\circ}\rightarrow\mathscr{L}\rightarrow\circ)$ conga allowed.