The article is so unclear!
"The Penrose Institute scientists are inviting readers to workout how white can win, or force a stalemate and then share their reasoning."
White can't win, without black deliberately trying to lose.
"The main goal is to force a draw, although it is even possible to trick black into a blunder that might allow white to win."
Can you really 'trick' a computer into a blunder?
"The first person who can demonstrate the solution legally will receive a bonus prize.
Both humans, computers and even quantum computers are invited to play the game and solutions should be emailed to puzzles
@penroseinstitute.com."
What does "demonstrate the solution legally" mean?
"The three bishops forces the computer to perform a massive search of possible positions that will rapidly expand to something that exceeds all the computational power on planet earth."
I think this is perhaps clearer. If you want to brute-force it then yes it will be massive on the computation front. Doing some rough calculations: there are about 25 different squares that black can move to in each move, followed by about 4 possible squares for the white King. (These are approximate, because it depends on the previous moves. Many times, the white King won't be able to move to black squares because the black bishops are covering them. If the King is in a corner then there are only 3 (or fewer) legal moves.)
For 50 moves this would give 100^50 possibilities, which is 10^100. Therefore there are a googol possible ways to reach then end of move 50 and the draw.
Surely chess boxes don't work like this, though...