Unexpected result from very simple statistics problem I have stumbled across this problem on my mathematics book, the problem states:
A person is distributing 3 packages in a city consisting of 3 houses, each package assigned to a single house. He has lost the delivery notes, and doesn't know which package belongs to which house. What is the chance that at least a single package makes its way to the correct location if he distributes them randomly?
To solve the problem I decided to draw a simple "state machine". I assume that the order of visiting the houses doesn't change the result (am I wrong here?). The number below each package (the stars) is the house it's meant to be delivered to.

Clearly, 4 out of the 6 final states have at least one correctly distributed package, so 2/3 is the result.
The solution stated by the book is 0.704 (it's rounded).
After puzzling for some time, I decided to code a quick simulation in C++, and the simulation (assuming the same premises as these used to build the graphic) converges to 2/3, too, so I wonder, am I interpreting the problem correctly? What method can lead to the result given in the book? I assume I'm missing a very easy and straightforward method as this book is designed for students new to statistics.
 A: I suspect your book contains an error, or you may have missed a detail you didn't give us.
We can represent the houses that the packages are delivered to as a permutation on 3 elements. For instance, the permutation $(123)$ represents the case where all packages are delivered correctly, and $(213)$ represents the case where the package to house $3$ is delivered correctly, and the other two have been switched.
Now, if your delivery person delivers packages at random, then every possible permutation is equally likely.
In this formulation, the probability that at least one package is delivered correctly is the probability that a random equiprobable permutation has at least one fixed point, i.e., at least one of the numbers is in the correct position.
Now, the total number of permutations on $n$ elements is $n!$. The number of permutations with at least one fixed point is $n!-!n$, where $!n$ gives the number of derangements, i.e., permutations with no fixed points. The Wikipedia page gives information and a recursive formula for $!n$.
In our case, $n=3$, so $n!=6$, and it turns out that $!n=2$. (The two derangements on $n=3$ elements are $(312)$ and $(231)$, all other permutations have at least one fixed point.) So the probability you are looking for is
$$\frac{n!-!n}{n!} = \frac{4}{6} = \frac{2}{3}. $$
Now, if your state machine, your simulation and this little calculation all end up with the same answer which is different from the one in your book, my conclusion is as above.
