36 Teams split into 4 groups of 9. There are 9 events and 9 rounds. A teams must face all other teams in the other groups. Okay here is my problem. I am not sure if this is possible or not as the 8 hours i have spent on this havn't been the best.

There are 4 groups of 9 teams. So we have teams A1 to A9, B1 to B9, C1 to C9, D1 to D9.
The are 9 rounds of 9 different events. Each event can hold 1 team from each group. How do i make it so that each team faces every other team that isn't in their group exactly once and no team twice. And every team goes to each event once and no event twice.

Some background, this is for a school event where our school has 4 different houses. I have been put in charge of setting together the timetable for the day and the way the teams mvoe around the events. There is no way i am able to just have 2 houses face each other at an event as 4 teams from different houses has to compete at each event. Principle wants 9 teams for each house to compete.

Is this possible? If this isnt possible, would it be possible if the number of teams went down to 8 with the number of events go down to 8 and rounds go down to 8 also?

Thanks
Consider a $9\times9$ array, where the row represents the event and the column represents the round.  For each house, arrange the $9$ copies numbers from $1$ to $9$ in the array, so that each number appears once in each row and each column.  That is, make a $9\times9$ Latin square.  Call these arrays $(a_{ij}),(b_{ij}),(c_{ij}),(d_{ij})$ for groups A,B,C,D, respectively.

If $a_ij=m$ for example, it means that team $A_m$ will play event $i$ in round $j$.  Now suppose that arrays $(a_{ij}),(b_{ij})$ are orthogonal, that is if $$a_{ij}=a_{mn}=x$$ and $$b_{ij}=b_{mn}=y$$ then $$x=y.$$  Then $A_x$ meets team $B_y$ at most once, and since $A_x$ must meets  $9$ different teams, it meets team $B_y$ exactly once.  

We see that the conditions can be fulfilled if and only if there exist $4$ pairwise orthogonal Latin squares.  Since $9=3^2$ is a prime power, it is known that there exist $8$ pairwise orthogonal Latin squares, and the answer is "yes."

The construction is described here.

EDIT

On reflection, I think I should have included a specific construction.  Here is a set of $8$ mutually orthogonal $9\times9$ Latin squares, the maximum possible.

$$\begin{array}{|c|c c c|c c c|c c c|}\hline&amp;1&amp;2&amp;3&amp;4&amp;5&amp;6&amp;7&amp;8&amp;9\\ \hline 1 &amp;11111111&amp;56489723&amp;98765432&amp;69358247&amp;72634859&amp;24973568&amp;85296374&amp;37542986&amp;43827695\\ 
2 &amp;22222222&amp;64597831&amp;79846513&amp;47169358&amp;83415967&amp;35781649&amp;96374185&amp;18653794&amp;51938476\\ 
3 &amp;33333333&amp;45678912&amp;87954621&amp;58247169&amp;91526748&amp;16892457&amp;74185296&amp;29461875&amp;62719584\\ 
\hline4 &amp;44444444&amp;89723156&amp;32198765&amp;93682571&amp;15967283&amp;57316892&amp;28539617&amp;61875329&amp;76251938\\ 
5 &amp;55555555&amp;97831264&amp;13279846&amp;71493682&amp;26748391&amp;68124973&amp;39617428&amp;42986137&amp;84362719\\ 
6 &amp;66666666&amp;78912345&amp;21387954&amp;82571493&amp;34859172&amp;49235781&amp;17428539&amp;53794218&amp;95143827\\ 
\hline7 &amp;77777777&amp;23156489&amp;65432198&amp;36925814&amp;48391526&amp;81649235&amp;52863941&amp;94218653&amp;19584362\\ 
8 &amp;88888888&amp;31264597&amp;46513279&amp;14736925&amp;59172634&amp;92457316&amp;63941752&amp;75329461&amp;27695143\\ 
9 &amp;99999999&amp;12345678&amp;54621387&amp;25814736&amp;67283415&amp;73568124&amp;41752863&amp;86137542&amp;38476251\\ 
\hline\end{array}$$

The rows represent rounds, and the columns represent events.  The table is for $8$ houses, say $A,B,C,D,E,F,G,H.$  The sequence indicates which teams from each house will compete in a particular event in a given round.  For example, at row $3$, column $4$ we find $58247169$.  The interpretation of this is that in round $3$, the teams that compete in event $4$ are $$A_5,B_8,C_2,D_4,E_7,F_1,G_6,\text{ and }H_9$$

In the instant case, where there are only $4$ houses, the last $4$ digits or each table entry can simply be ignored.
Initially, there are $9^4$ to organize an event. But every time you do it, you're eliminating not only one possibility out of the $9^4$. Indeed, if I picked up $\{A_1,B_1,C_1,D_1\}$ for the first event, I could not pick later any order in which $\{A_1, B_1\}$ appeared, which is $9^2-1$. On top of that, there are $\binom 4 2=6$ ways of choosing a pair out of the first event, so the previous number gets multiplied by $6$.

So you organized your first event and now, out of the $9^4$ options, there are only $9^4-6\times(9^2-1)$ left. For how many events can you do that? Simply calculate $\frac {9^4}{6\times(9^2-1)}$ and take the integer part. This actually already answers your second question.