<s>[INST] In a game of chess, the queen is the most powerful piece. You can move your queen to any square on the board that is horizontally, vertically, or diagonally in line with your queen. Given the following chess board:

`A B C D E F G H`
`1 | | | | | | | |`
`2 | | | | | | | |`
`3 | | | | | | | |`
`4 | | | | | | | |`
`5 | | | | | | | |`
`6 | | | | | | | |`
`7 | | | | | | | |`
`8 | | | | | | | |`

Suppose your queen is at square E5. Using the Breadth-First Search (BFS) algorithm, implement a function that generates all possible moves (horizontally, vertically, or diagonally) from the current position of the queen. Please use a priority queue to order your moves.

Note: Keep in mind that we're considering an 8x8 chessboard. For the purpose of this problem, do not worry about other pieces on the board: we only care about the possible moves of the queen.[/INST]