Is there a name for the problem of trying to place as many queens on a chess board as possible without checking (or stalemating) the opposing king?

The number is more than 9, which is the most a player could have in a normal game, so it's even less relevant to the game of chess than the N-queens problem, but it seems like the problems might be related.