Can engines analyze this position and can white win?

[Uri Blass]

I am not sure if white is winning and it may be a draw with correct play.

[peter]

I am not sure if white is winning and it may be a draw with correct play.

First you log in at Facebook, because link says so, then there's just the same weird picture to be seen already on screen- shot, in meantime I'm not sure anymore, if it's just a (to me) doubtfully funny joke or maybe yet meant seriously

Anyhow, one can spare logging in at Facebook, not any better pic there to be seen neither, regards

[jefk]

it's like "infinite chess"
https://en.wikipedia.org/wiki/Infinite_chess
and it's a draw, of course obviously.
(Black has sufficient degrees of freedom to prevent any forced
win for White, thus it's a 'balanced game' thus a draw).

[Ajedrecista]

Hello Peter:

[...] it's just a (to me) doubtfully funny joke [...]

Pointless, unfunny joke for me. I see that it is a 32×32 chessboard. Assuming the same moves than standard chess:

Perft(1) = 20 (the usual moves on 8×8) + 2·12 (rooks in the first row) + 2·1 (knights to the second row) = 46.
Perft(2) = [Perft(1)]² = 2116.

Imagine the branching factor at higher depths. More generally, in a N×N chessboard (N even and N > 8) with the pieces centered with respect of the columns and no rows behind the major pieces:

Perft(1) = 20 + (N - 8) + 2 = N + 14.
Perft(2) = [Perft(1)]² = (N + 14)² = N² + 28·N + 196 (order of N² with big N).

Even the N queens puzzle is unsolved nowadays for 28×28 onwards (links to OEIS and Wikipedia).

Regards from Spain.

Ajedrecista.