Given a positive integer $n$, suppose that $P(x,y)$ is a real polynomial such that 
\[P(x,y)=\frac{1}{1+x+y} \hspace{0.5cm} \text{for all $x,y\in\{0,1,2,\dots,n\}$} \] What is the minimum degree of $P$?

[i]Proposed by Loke Zhi Kin[/i]
1. **Observation and Assumption**: We start by noting that we can assume no term \( x^a y^b \) appears where \( \max\{a, b\} \ge n+1 \). This is because if \( a \ge n+1 \), we can divide \( x^a \) by \( x(x-1)\cdots (x-n) \) and replace it with the remainder. This process does not change the polynomial \( P(x, y) \).

2. **Defining \( P_j(y) \)**: Let \( P_j(y) = P(j, y) \) for \( 0 \le j \le n \). Since \( P(x, y) = \frac{1}{1+x+y} \) for all \( x, y \in \{0, 1, 2, \dots, n\} \), we know that \( \deg P_j \le n \).

3. **Lagrange Interpolation**: By Lagrange Interpolation, there exist unique real coefficients \( a_{n,j}, a_{n-1,j}, \ldots, a_{0,j} \) such that 
   \[
   P_j(y) = a_{n,j} y^n + a_{n-1,j} y^{n-1} + \cdots + a_{1,j} y + a_{0,j}.
   \]

4. **Defining \( A_k(x) \)**: Let \( A_k \) be the unique polynomial of degree at most \( n \) such that \( A_k(x) = a_{x,k} \). This implies that 
   \[
   P(x, y) = A_n(x) y^n + A_{n-1}(x) y^{n-1} + \cdots + A_0(x).
   \]

5. **Checking the Degree**: We need to check that the term \( [x^n y^n] P(x, y) \neq 0 \). Since \( P(x, y) = \frac{1}{1+x+y} \), we can expand it as a power series:
   \[
   \frac{1}{1+x+y} = \sum_{k=0}^{\infty} (-1)^k (x+y)^k.
   \]
   For \( x, y \in \{0, 1, 2, \dots, n\} \), the highest degree term in this expansion is \( (x+y)^n \), which includes terms of the form \( x^a y^b \) where \( a + b = n \). Therefore, the minimum degree of \( P(x, y) \) must be \( 2n \).

Conclusion:
The minimum degree of \( P(x, y) \) is \( 2n \).

The final answer is \( \boxed{ 2n } \).