Let $M$ be an inner model (of height $\mathsf{Ord}$) containing all the reals. I am wondering about the consistency strength of the statement "Every game in $M$ is determined in $V$."

MOTIVATION

For the statement of AD, games are restricted to be played on natural numbers, terminating after $\omega$ plays. In that case payoffs correspond to subsets of $\omega^\omega$.

There are various ways of generalizing this; for example, given $X$ and $A \subset X^\omega$, one can define the game $G_X(A)$ where each player takes turns choosing from $X$, and where the payoff is given by $A$.

With that definition of "game," it is not possible that every game in $M$ is determined in $M$. Indeed, suppose $AD^M$ holds: I define a nondetermined game played on $\omega_1$ (following Kanamori).

On the first move, player I picks some $\alpha < \omega_1$. On the subsequent moves, player II picks elements of $\{0, 1\}$. Player II wins iff his/her sequence of bits encodes $\alpha$.

Letting $A$ be the payoff corresponding to the above, then $G_{\omega_1}(A)$ cannot be determined in $M$. But it is certainly determined in $V$!

QUESTION

So, to reiterate, I am curious about the hypothesis "Every game in $M$ is determined in $V$." Note that this encompasses $AD^M$ since $M$ contains every real. There are a couple subquestions:

(a) Is this hypothesis outright inconsistent?

(b) Is this hypothesis equivalent to $AD^M$, or to, say, $AD_{R}^M$?

(c) Does this hypothesis depend on the precise generalization of games I use? (Another generalization would be to allow ordinal-length games, for example.)