Let us say we have 10 placards with numbers from (-5 to 5 excluding zero) laid in a circular fashion. In each round, you perform a swap such that you switch the position of two adjacent placards . Find the expected number of swaps such that no two adjacent placards sum to zero.
I am looking for translating this into a markov chain, could someone give me an idea?