I wonder if chess is a draw with less ranks

[Uri Blass]

With 4 ranks it is obviously mate in 1 for white who win by e2xf3#
What about 5 ranks or 6 rankss?

Is there a software to analyze it?

rules are the same as normal chess when pawns can go 2 squares forward only in the first move and promote when they go to their last rank.

I guess white is going to win with 5 ranks but I know no software to make a serious analysis.

Not sure about 6 ranks or 7 ranks

[jefk]

you could setup some prototype(s) - in a rather easy- way with
Zillionsofgames and then see how it goes; disadvantage then is that
the engine isn't strong. So that would result in yet some more chess
variants; thereby with much less ranks i would be inclined to let the
first pawns moves only going one rank further (instead of two).

[Jouni]

I guess, that 5, 6 and possible 7 ranks can be fully analyzed in reasonable time.

[Uri Blass]

I guess, that 5, 6 and possible 7 ranks can be fully analyzed in reasonable time.

I agree about 5 but I am not sure if it is possible to analyze 6 ranks in a reasonable time.
Even without solving the game we probably can get conclusions about 6 and 7 based on engine-engines games like we do in chess because all engine-engine games end at the same result but it is not a proof.

We can have 2 options for the pawn moves.
Generalization of chess can claim that the pawn is allowed to move 2 squares forward in the first move but another generalization is when the pawn is allowed to move 2 pawns forward only when it is at distance of at least 6 ranks from promotion and in this case smaller board means not being able to move 2 squares forward.

Both are natural generalization of chess.

I guess it is simpler to solve the problem when the pawn is not allowed to move 2 squares forward because we have less possibilities.

[Ajedrecista]

Hello Uri:

With 4 ranks it is obviously mate in 1 for white who win by e2xf3#
What about 5 ranks or 6 rankss?

Is there a software to analyze it?

rules are the same as normal chess when pawns can go 2 squares forward only in the first move and promote when they go to their last rank.

I guess white is going to win with 5 ranks but I know no software to make a serious analysis.

Not sure about 6 ranks or 7 ranks

Excellent question, as usual. I do not know about such software. I would add that telling the board size is not enough. For example, in 4×4, are we talking about RQKR setting or NQKN or BQKB or other one? The same with the first move of pawns, castlings and en passant captures in enough large boards.

Wikipedia features an article on minichess. The 6×6 bishopless variant (RNQKNR) is historically significant in computer chess in the 1950s: Los Alamos chess variant as the first chess-like game played by a computer programme (no pawn double-step move, no en passant captures, no castlings and no underpromotions to bishops). The original report with technical details of MANIAC I playing Los Alamos Chess is found at pages 13 to 16 of the January, 1957 issue of Chess Review magazine (link to the issue).

------------

I have been interested for years in the same concept of miniboards of English draughts/American checkers until I found a software a week ago to play with (link to the post)! It is the historic SAGE programme. I stick to even numbers of files and ranks to keep symmetries of the two sides. My finds with best play so far are:

Code: Select all

Pieces per side = (Files/2)*(Ranks/2 - 1)

=======================================
   SIZE        Pieces
Files Ranks   per side   Result
=======================================
  4     4        2       Draw
  4     6        4       2nd player win
  4     8        6       Draw
  6     4        3       Draw
  6     6        6       Draw
  6     8        9       Draw
  8     4        4       Draw
  8     6        8       Draw

The second player win in 4×6 should be something like this:

Code: Select all

1st player pieces on 1, 2, 3 and 4.
2nd player pieces on 9, 10, 11 and 12.

   2nd PLAYER
+---+---+---+---+
|   | 12|   | 11|
+---+---+---+---+
| 10|   | 9 |   |
+---+---+---+---+
|   | 8 |   | 7 |
+---+---+---+---+
| 6 |   | 5 |   |
+---+---+---+---+
|   | 4 |   | 3 |
+---+---+---+---+
| 2 |   | 1 |   |
+---+---+---+---+
   1st PLAYER

 1.  4-6   10-8     2.  2-4   12-10     3.  3-5     8x3     4.  4-5    9-7     5.  5-8   10x5
 6.  6-8    5-4     7.  1x6    3-1      8.  8-10    1-3     9. 10-12   3-5    10. 12-10   5-8
11. 10x5    7x4    12.  6-8    4-1     13.  8-10   11-9    14. 10-12   9-8    15. 12-9    1-3
16.  9x6    3-5    17.  6-8    5x10

 1.  4-6   10-8     2.  2-4   12-10     3.  3-5     8x3     4.  4-5    9-7     5.  5-8   10x5
 6.  6-8    5-4     7.  1x6    7-5      8.  8-10    3-1     9. 10-12   5-4    10. 12-10   1-3
11. 10-8    4-1    12.  8-10   3-5     13. 10-12    5-8    14.  6x9   11x8    12. 12-9    1-3
16.  9x6    3-5    17.  6-8    5x10

Odd numbers for files and/or ranks can be tried, of course, as well as different pieces per side than the usual (Files/2)*(Ranks - 2)/2 = (Files/2)*(Ranks/2 - 1).

------------

Hello Jouni:

I guess, that 5, 6 and possible 7 ranks can be fully analyzed in reasonable time.

I disagree on 7×7 full analysis in reasonable time due to the high branching factor and the state-space complexity. I even doubt about 6×6 for the same reasons, but I would be happy if proven wrong.

Regards from Spain.

Ajedrecista.