A simple game on infinite chessboard

Player $A$ chooses two queens and an arbitrary finite number of bishops on $\infty \times \infty$ chessboard and places them wherever he/she wants. Then player $B$ chooses one knight and places him wherever he/she wants (but of course, knight cannot be placed on the fields which are under attack by $A$).

Then the game starts. First move is a move by player $A$, then by player $B$, and so on...

If $A$ succeeds in finding a trap for $B$ (check-mates him) the game is over and $A$ wins. If $B$ can avoid being check-mated indefinitely then $B$ wins .

Does $B$ always has a winning strategy?

There are two versions of this game:

1) Knight is not allowed to capture figures of $A$.

2) Knight is allowed to capture figures of $A$.

I would very like to see the solution of at least one of those two versions.

For the purposes of this question, suppose whatever version you want.

This is one of my problems, I like to create problems, especially simple ones.

Peter mentioned a very good question in a chat, namely the issue of a draw, so

*) If a knight is not under attack at some field but cannot move anywhere because all the fields where he can move are under attack then that is a draw.

So, $A$ wins if he/she checkmates knight, that is, if she/he attacks knight and knight does not have a field to move on because all are under attack, including the one at which he is at.

Notify me if we can improve this question.

Also, I think that there is an amount of bishops that guarantees the win of $A$, but do not know bounds on the number of bishops that guarantee the win.

And, if knight is not allowed to capture figures of $A$, then I think that two queens and three bishops always have a winning strategy.

Update: We have some strategies for $7$ bishops alone, which would mean that two queens and five bishops are enough, but with two queens the $5$ is too many bishops, Peter has the question on "are only two queens sufficient"? Also, now I think that two queens and two bishops are enough to always secure a winning strategy.

"Does $B$ always has a winning strategy"?

No, infact player $A$ will always win with the right strategy. With the help of user Andreas Lietz, I have found a minimum bound of the number of bishops ($7$ bishops) with which player $A$ always wins regardless of whether the knight is allowed to capture $A$'s bishops. The basic idea of this strategy is to form too walls from which the knight cannot pass, and move one of the the walls closer to the other eventually check-mating the knight.

Let the triangles represent the bishops and the circle represent the knight. (Sorry for the terrible visual representation.)

Winning Strategy using minimum number of bishops:

$(1)$ Player $A$ should choose exactly $7$ bishops and spread them far apart so that the knight cannot trap capture any of them when placed by player $B$. Also make sure $4$ of them are on white squares and $3$ of them on black or vice-versa. enter image description here

$(2)$ Choose a location far from the knight and form a wall of $3$ bishops in a row (represented by the red triangles). This wall (blue line) cannot be crossed by the knight as it cannot move more than $2$ steps vertically or horizontally. enter image description here

$(3)$ Move the remaining two black and two white bishops (represented by yellow triangles) to another location far from the knight and form an alternating black and white wall of bishops. The knight is now traped in the pink area as shown in the 3rd picture.

$(4)$ To form the wall, only 3 bishops are enough, so one can move the farthest bishop to the front to close the gap between the two walls.

$(5)$ Keep repeating step $(4)$ until the gap closes and the knight is captured. If the knight ever comes close to a bishop, they can travel along the diagonal of the wall a long distance without changing the wall. enter image description here

User ArsenBerk has also pointed out that player $A$ can always avoid a draw by limiting the knight to $2$ diagonals using two walls of three bishops each and using the last bishop to attack the diagonal the knight is on. Finally, a bishop from one of the walls can check-mate the king.

enter image description here