After the first gamete, you have one chromosome from each pair. Each subsequent step then completes a random subset of the uncompleted chromosome pairs. Let $E_n$ be the expected time it takes to complete $n$ half-completed pairs (so the answer you want is $1+E_{23}$). There is a $\binom{n}{n-k}(\frac12)^{n-k}(1-\frac12)^k$ chance that on the next step you will have $k$ more pairs to go, so that $$ E_n = 1+\frac1{2^n}\sum_{k=0}^n\binom{n}{n-k}E_k $$ The above equation has $E_n$ on both sides: solving for $E_n$, we get a formula for this in terms of earlier values: $$ E_n = \frac{2^n}{2^n-1}+\frac{1}{2^n-1}\sum_{k=0}^{n-1}\binom{n}{k}E_k $$ This allows you to compute $E_n$ recursively. Using Mathematica, I found that $1+E_{23}\approx 6.8877$.