6. Team A and Team B each draw 7 players to participate in a Go relay match according to a pre-arranged order. Both sides start with their No. 1 players competing. The loser is eliminated, and the winner then competes with the No. 2 player of the losing side, $\cdots$, until all players of one side are eliminated, and the other side wins, forming a match process. The total number of all possible match processes is $\qquad$ (1988 National High School League Question)
6. First consider the match process where Team A wins. Let the $i$-th player of Team A win $x_{i}$ matches $(i=1,2, \cdots, 7)$, then $x_{1}+x_{2}+x_{3}+$ $x_{4}+x_{5}+x_{6}+x_{7}=7$, and the match process where Team A wins corresponds one-to-one with the non-negative integer solutions of the indeterminate equation $x_{1}+x_{2}+\cdots+x_{7}=7$, which is $\left(x_{1}\right.$, $x_{2}, \cdots, x_{7}$ ). Therefore, the number of different match processes where Team A wins is equal to the number of non-negative integer solutions of the indeterminate equation $x_{1}+x_{2}+\cdots+x_{7}=7$, which is $C_{13}^{6}$. Similarly, the number of match processes where Team B wins is also $C_{13}^{6}$. Therefore, the total number of different match processes is $2 C_{13}^{6}=$ 3432.