We introduce achievement positional games, a convention for positional games which encompasses the Maker-Maker and Maker-Breaker conventions. We consider two hypergraphs, one red and one blue, on the same vertex set. Two players, Left and Right, take turns picking a previously unpicked vertex. Whoever first fills an edge of their color, blue for Left or red for Right, wins the game (draws are possible). We establish general properties of such games. In particular, we show that a lot of principles which hold for Maker-Maker games generalize to achievement positional games. We also study the algorithmic complexity of deciding whether Left has a winning strategy as the first player when blue edges and red edges have respective sizes at most $p$ and $q$. This problem is in P for $p,q \leq 2$, but it is NP-hard for $p \geq 3$ and $q=2$, coNP-complete for $p=2$ and $q \geq 3$, and PSPACE-complete for $p,q \geq 3$ even when the 3-edges are the same for both colors. That last result has an interesting consequence on the Maker-Maker convention: for 3-uniform hypergraphs, which is the only case whose complexity is currently open (for starting positions of the game), we show PSPACE-completeness for positions obtained after one round of play.