We investigate a two player game called the $K^4$-building game: two players alternately claim edges of an infinite complete graph. Each player's aim is to claim all six edges on some vertex set of size four for themself. The first player to accomplish this goal is declared the winner of the game. We present a winning strategy which guarantees a win for the first player.