Post History

8 coexisting queens

This is a fixed output challenge. Output a textual representation of a chessboard hosting 8 queens, none of which are attacking each other.

There are 92 ways of arranging them, 12 if rotations and reflections are discounted. You may choose any of these arrangements.

## Input
- There is no input for this challenge

## Output
- 8 newline separated lines of 8 characters, with an optional trailing newline
- Each character is either a queen or an empty space. You may choose any two distinct characters to represent a queen and an empty space
- No more than 1 queen appears in each row, column, and diagonal
- Your output must be the same each time (your code must have deterministic output, even if it uses a probabilistic approach internally)

## Scoring
Despite there being 92 valid outputs, this is a standard code golf challenge. Your score is the number of bytes in your code.


> Explanations in answers are optional, but I'm more likely to upvote answers that have one.