JumbleG is a Maker–Breaker game. Maker and Breaker take turns in choosing edges from the complete graph $K_n$. Maker's aim is to choose what we call an $\epsilon$-regular graph (that is, the minimum degree is at least $(\frac12-\epsilon) n$ and, for every pair of disjoint subsets $S,T\subset V$ of cardinalities at least $\epsilon n$, the number of edges $e(S,T)$ between $S$ and $T$ satisfies $\bigl|\frac{e(S,T)}{|S|\,|T|}-\frac12\bigr|\leq \epsilon$.) In this paper we show that Maker can create an $\epsilon$-regular graph, for $\epsilon\geq 2(\log n/n)^{1/3}$. We also consider a similar game, JumbleG2, where Maker's aim is to create a graph with minimum degree at least $\bigl(\frac12-\epsilon\bigr)n$ and maximum co-degree at most $\bigl(\frac14+\epsilon\bigr)n$, and show that Maker has a winning strategy for $\epsilon> 3 (\log n/n)^{1/2}$. Thus, in both games Maker can create a pseudo-random graph of density $\frac12$. This guarantees Maker's win in several other positional games, also discussed here.