When the naive shuffle is biased

A buggy shuffle of $3$ items runs $i = 1, 2, 3$ and at each step swaps position $i$ with a position chosen uniformly from all three positions (the correct Fisher–Yates would restrict the choice to positions $\ge i$). Under this buggy version, what is the probability the array ends in its original order? Give it to four decimal places.