Since no firstrank constant has been stored for this game, one will be calculated by analyzing the moves in the game. This will work only if the game lasted long enough to put enough pieces into play.

mv is b2-b3, p is #p, o is b2

space b2 is P

0 P b2-b3 27 61 59 61 59 61 59 29

11011 111101 111011 111101 111011 111101 111011 11101

mv is p d7-d5, p is p, o is d7

space d7 is p

1 p p d7-d5 27 61 59 61 59 61 59 29

11011 111101 111011 111101 111011 111101 111011 11101

mv is f2-f3, p is #p, o is f2

space f2 is P

2 P f2-f3 27 61 59 61 59 61 59 29

11011 111101 111011 111101 111011 111101 111011 11101

mv is b e8-b5, p is b, o is e8

space e8 is e1

3 e1 b e8-b5 27 61 59 61 59 61 59 29

11011 111101 111011 111101 111011 111101 111011 11101

5 one bits in var e1

11011 111101 111011 111101 10 111101 111011 11101

q end b e8-b5 27 61 59 61 2 61 59 29

bb end b e8-b5 25 61 57 61 2 61 57 29

bw end b e8-b5 25 61 57 61 2 61 57 29

firstr is a1, and lastr is h1

r b e8-b5 25 61 57 61 2 61 57 29

first 25 61 57 61 2 61 57 29

11001 111101 111001 111101 10 111101 111001 11101

q end b e8-b5 25 61 57 61 2 61 57 29

bb end b e8-b5 25 61 57 61 2 61 57 29

bw end b e8-b5 25 61 57 61 2 61 57 29

firstr is a1, and lastr is h1

r b e8-b5 25 61 57 61 2 61 57 29

first 25 61 57 61 2 61 57 29

mv is g1-c5, p is #p, o is g1

space g1 is g1

4 g1 g1-c5 25 61 57 61 2 61 57 29

11001 111101 111001 111101 10 111101 111001 11101

4 one bits in var g1

11001 111101 111001 111101 10 111101 10000 11101

queen before g1-c5 25 61 57 61 2 61 16 29

queen after g1-c5 9 45 41 45 2 45 16 13

q end g1-c5 9 45 41 45 2 45 16 13

bb end g1-c5 9 45 41 45 2 45 16 13

bw end g1-c5 9 45 41 45 2 45 16 13

firstr is a1, and lastr is h1

r g1-c5 9 45 41 45 2 45 16 13

first 9 45 41 45 2 45 16 13

1001 101101 101001 101101 10 101101 10000 1101

q end g1-c5 9 45 41 45 2 45 16 13

bb end g1-c5 9 45 41 45 2 45 16 13

bw end g1-c5 9 45 41 45 2 45 16 13

firstr is a1, and lastr is h1

r g1-c5 9 45 41 45 2 45 16 13

first 9 45 41 45 2 45 16 13

mv is b b5-e2, p is b, o is b5

space b5 is e1

5 e1 b b5-e2 9 45 41 45 2 45 16 13

1001 101101 101001 101101 10 101101 10000 1101

1 one bits in var e1

1001 101101 101001 101101 10 101101 10000 1101

q end b b5-e2 9 45 41 45 2 45 16 13

bb end b b5-e2 9 45 41 45 2 45 16 13

bw end b b5-e2 9 45 41 45 2 45 16 13

firstr is a1, and lastr is h1

r b b5-e2 9 45 41 45 2 45 16 13

first 9 45 41 45 2 45 16 13

mv is c5-e7, p is #p, o is c5

space c5 is g1

6 g1 c5-e7 9 45 41 45 2 45 16 13

1001 101101 101001 101101 10 101101 10000 1101

1 one bits in var g1

1001 101101 101001 101101 10 101101 10000 1101

q end c5-e7 9 45 41 45 2 45 16 13

bb end c5-e7 9 45 41 45 2 45 16 13

bw end c5-e7 9 45 41 45 2 45 16 13

firstr is a1, and lastr is h1

r c5-e7 9 45 41 45 2 45 16 13

first 9 45 41 45 2 45 16 13

mv is b e2-d1, p is b, o is e2

space e2 is e1

7 e1 b e2-d1 9 45 41 45 2 45 16 13

1001 101101 101001 101101 10 101101 10000 1101

1 one bits in var e1

1001 101101 101001 101101 10 101101 10000 1101

q end b e2-d1 9 45 41 45 2 45 16 13

bb end b e2-d1 9 45 41 45 2 45 16 13

bw end b e2-d1 9 45 41 45 2 45 16 13

firstr is a1, and lastr is h1

r b e2-d1 9 45 41 45 2 45 16 13

first 9 45 41 45 2 45 16 13

mv is e1-h4, p is #p, o is e1

space e1 is e1

8 e1 e1-h4 9 45 41 45 2 45 16 13

1001 101101 101001 101101 10 101101 10000 1101

1 one bits in var e1

1001 101101 101001 101101 10 101101 10000 1101

q end e1-h4 9 45 41 45 2 45 16 13

bb end e1-h4 9 45 41 45 2 45 16 13

bw end e1-h4 9 45 41 45 2 45 16 13

firstr is a1, and lastr is h1

r e1-h4 9 45 41 45 2 45 16 13

first 9 45 41 45 2 45 16 13

mv is n f8-e6, p is n, o is f8

space f8 is f1

9 f1 n f8-e6 9 45 41 45 2 45 16 13

1001 101101 101001 101101 10 101101 10000 1101

4 one bits in var f1

1001 101101 101001 101101 10 1 10000 1101

q end n f8-e6 9 45 41 45 2 1 16 13

bb end n f8-e6 9 45 41 45 2 1 16 13

bw end n f8-e6 9 45 41 45 2 1 16 13

firstr is a1, and lastr is h1

r n f8-e6 9 45 41 45 2 1 16 13

first 9 45 41 45 2 1 16 13

mv is c1-d1, p is #p, o is c1

space c1 is c1

10 c1 c1-d1 9 45 41 45 2 1 16 13

1001 101101 101001 101101 10 1 10000 1101

3 one bits in var c1

1001 101101 101000 101101 10 1 10000 1101

q end c1-d1 9 45 40 45 2 1 16 13

bb end c1-d1 9 45 40 45 2 1 16 13

bw end c1-d1 9 45 40 45 2 1 16 13

firstr is a1, and lastr is h1

r c1-d1 9 45 40 45 2 1 16 13

first 9 45 40 45 2 1 16 13

mv is n h8-g6, p is n, o is h8

space h8 is h1

11 h1 n h8-g6 9 45 40 45 2 1 16 13

1001 101101 101000 101101 10 1 10000 1101

3 one bits in var h1

1001 101101 101000 101101 10 1 10000 1

q end n h8-g6 9 45 40 45 2 1 16 1

bb end n h8-g6 9 45 40 45 2 1 16 1

bw end n h8-g6 9 45 40 45 2 1 16 1

firstr is a1, and lastr is d1

r n h8-g6 9 45 40 13 2 1 16 1

first 9 45 40 13 2 1 16 1

1000 101100 101000 1100 10 1 10000 1

q end n h8-g6 8 44 40 12 2 1 16 1

bb end n h8-g6 8 44 40 12 2 1 16 1

bw end n h8-g6 8 44 40 12 2 1 16 1

firstr is a1, and lastr is d1

One Rook found

b1 44

r n h8-g6 8 36 40 12 2 1 16 1

first 8 36 40 12 2 1 16 1

1000 100100 101000 1100 10 1 10000 1

q end n h8-g6 8 36 40 12 2 1 16 1

bb end n h8-g6 8 36 40 12 2 1 16 1

bw end n h8-g6 8 36 40 12 2 1 16 1

firstr is a1, and lastr is d1

One Rook found

b1 36

r n h8-g6 8 36 40 12 2 1 16 1

first 8 36 40 12 2 1 16 1

mv is e7-d8, p is #p, o is e7

space e7 is g1

12 g1 e7-d8 8 36 40 12 2 1 16 1

1000 100100 101000 1100 10 1 10000 1

1 one bits in var g1

1000 100100 101000 1100 10 1 10000 1

q end e7-d8 8 36 40 12 2 1 16 1

bb end e7-d8 8 36 40 12 2 1 16 1

bw end e7-d8 8 36 40 12 2 1 16 1

firstr is a1, and lastr is d1

One Rook found

b1 36

r e7-d8 8 36 40 12 2 1 16 1

first 8 36 40 12 2 1 16 1

mv is n e6-d8, p is n, o is e6

space e6 is f1

13 f1 n e6-d8 8 36 40 12 2 1 16 1

1000 100100 101000 1100 10 1 10000 1

1 one bits in var f1

1000 100100 101000 1100 10 1 10000 1

q end n e6-d8 8 36 40 12 2 1 16 1

bb end n e6-d8 8 36 40 12 2 1 16 1

bw end n e6-d8 8 36 40 12 2 1 16 1

firstr is a1, and lastr is d1

One Rook found

b1 36

r n e6-d8 8 36 40 12 2 1 16 1

first 8 36 40 12 2 1 16 1

mv is h4-d8, p is #p, o is h4

space h4 is e1

14 e1 h4-d8 8 36 40 12 2 1 16 1

1000 100100 101000 1100 10 1 10000 1

1 one bits in var e1

1000 100100 101000 1100 10 1 10000 1

q end h4-d8 8 36 40 12 2 1 16 1

bb end h4-d8 8 36 40 12 2 1 16 1

bw end h4-d8 8 36 40 12 2 1 16 1

firstr is a1, and lastr is d1

One Rook found

b1 36

r h4-d8 8 36 40 12 2 1 16 1

first 8 36 40 12 2 1 16 1

mv is q g8-d8, p is q, o is g8

space g8 is g1

15 g1 q g8-d8 8 36 40 12 2 1 16 1

1000 100100 101000 1100 10 1 10000 1

1 one bits in var g1

1000 100100 101000 1100 10 1 10000 1

q end q g8-d8 8 36 40 12 2 1 16 1

bb end q g8-d8 8 36 40 12 2 1 16 1

bw end q g8-d8 8 36 40 12 2 1 16 1

firstr is a1, and lastr is d1

One Rook found

b1 36

r q g8-d8 8 36 40 12 2 1 16 1

first 8 36 40 12 2 1 16 1

mv is c2-c3, p is #p, o is c2

space c2 is P

16 P c2-c3 8 36 40 12 2 1 16 1

1000 100100 101000 1100 10 1 10000 1

mv is p c7-c5, p is p, o is c7

space c7 is p

17 p p c7-c5 8 36 40 12 2 1 16 1

1000 100100 101000 1100 10 1 10000 1

mv is f1-e3, p is #p, o is f1

space f1 is f1

18 f1 f1-e3 8 36 40 12 2 1 16 1

1000 100100 101000 1100 10 1 10000 1

1 one bits in var f1

1000 100100 101000 1100 10 1 10000 1

q end f1-e3 8 36 40 12 2 1 16 1

bb end f1-e3 8 36 40 12 2 1 16 1

bw end f1-e3 8 36 40 12 2 1 16 1

firstr is a1, and lastr is d1

One Rook found

b1 36

r f1-e3 8 36 40 12 2 1 16 1

first 8 36 40 12 2 1 16 1

mv is q d8-d7, p is q, o is d8

space d8 is g1

19 g1 q d8-d7 8 36 40 12 2 1 16 1

1000 100100 101000 1100 10 1 10000 1

1 one bits in var g1

1000 100100 101000 1100 10 1 10000 1

q end q d8-d7 8 36 40 12 2 1 16 1

bb end q d8-d7 8 36 40 12 2 1 16 1

bw end q d8-d7 8 36 40 12 2 1 16 1

firstr is a1, and lastr is d1

One Rook found

b1 36

r q d8-d7 8 36 40 12 2 1 16 1

first 8 36 40 12 2 1 16 1

mv is b1-f5, p is #p, o is b1

space b1 is b1

20 b1 b1-f5 8 36 40 12 2 1 16 1

1000 100100 101000 1100 10 1 10000 1

2 one bits in var b1

1000 100 101000 1100 10 1 10000 1

c1

Array
(
    [0] => a1
    [1] => b1
)

q end b1-f5 8 4 32 8 2 1 16 1

bb end b1-f5 8 4 32 8 2 1 16 1

bw end b1-f5 8 4 32 8 2 1 16 1

first 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

c1

Array
(
    [0] => a1
    [1] => b1
)

q end b1-f5 8 4 32 8 2 1 16 1

bb end b1-f5 8 4 32 8 2 1 16 1

bw end b1-f5 8 4 32 8 2 1 16 1

first 8 4 32 8 2 1 16 1

mv is q d7-f5, p is q, o is d7

space d7 is g1

21 g1 q d7-f5 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

1 one bits in var g1

1000 100 100000 1000 10 1 10000 1

c1

Array
(
    [0] => a1
    [1] => b1
)

q end q d7-f5 8 4 32 8 2 1 16 1

bb end q d7-f5 8 4 32 8 2 1 16 1

bw end q d7-f5 8 4 32 8 2 1 16 1

first 8 4 32 8 2 1 16 1

mv is e3-f5, p is #p, o is e3

space e3 is f1

22 f1 e3-f5 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

1 one bits in var f1

1000 100 100000 1000 10 1 10000 1

c1

Array
(
    [0] => a1
    [1] => b1
)

q end e3-f5 8 4 32 8 2 1 16 1

bb end e3-f5 8 4 32 8 2 1 16 1

bw end e3-f5 8 4 32 8 2 1 16 1

first 8 4 32 8 2 1 16 1

mv is b b8-e5, p is b, o is b8

space b8 is b1

23 b1 b b8-e5 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

1 one bits in var b1

1000 100 100000 1000 10 1 10000 1

c1

Array
(
    [0] => a1
    [1] => b1
)

q end b b8-e5 8 4 32 8 2 1 16 1

bb end b b8-e5 8 4 32 8 2 1 16 1

bw end b b8-e5 8 4 32 8 2 1 16 1

first 8 4 32 8 2 1 16 1

mv is g2-g3, p is #p, o is g2

space g2 is P

24 P g2-g3 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

mv is r a8-d8, p is r, o is a8

space a8 is a1

25 a1 r a8-d8 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

1 one bits in var a1

1000 100 100000 1000 10 1 10000 1

c1

Array
(
    [0] => a1
    [1] => b1
)

q end r a8-d8 8 4 32 8 2 1 16 1

bb end r a8-d8 8 4 32 8 2 1 16 1

bw end r a8-d8 8 4 32 8 2 1 16 1

first 8 4 32 8 2 1 16 1

mv is f3-f4, p is #p, o is f3

space f3 is P

26 P f3-f4 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

mv is b e5-f6, p is b, o is e5

space e5 is b1

27 b1 b e5-f6 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

1 one bits in var b1

1000 100 100000 1000 10 1 10000 1

c1

Array
(
    [0] => a1
    [1] => b1
)

q end b e5-f6 8 4 32 8 2 1 16 1

bb end b e5-f6 8 4 32 8 2 1 16 1

bw end b e5-f6 8 4 32 8 2 1 16 1

first 8 4 32 8 2 1 16 1

mv is d1-c2, p is #p, o is d1

space d1 is c1

28 c1 d1-c2 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

1 one bits in var c1

1000 100 100000 1000 10 1 10000 1

c1

Array
(
    [0] => a1
    [1] => b1
)

q end d1-c2 8 4 32 8 2 1 16 1

bb end d1-c2 8 4 32 8 2 1 16 1

bw end d1-c2 8 4 32 8 2 1 16 1

first 8 4 32 8 2 1 16 1

mv is n g6-e7, p is n, o is g6

space g6 is h1

29 h1 n g6-e7 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

1 one bits in var h1

1000 100 100000 1000 10 1 10000 1

c1

Array
(
    [0] => a1
    [1] => b1
)

q end n g6-e7 8 4 32 8 2 1 16 1

bb end n g6-e7 8 4 32 8 2 1 16 1

bw end n g6-e7 8 4 32 8 2 1 16 1

first 8 4 32 8 2 1 16 1

mv is f5-e7, p is #p, o is f5

space f5 is f1

30 f1 f5-e7 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

1 one bits in var f1

1000 100 100000 1000 10 1 10000 1

c1

Array
(
    [0] => a1
    [1] => b1
)

q end f5-e7 8 4 32 8 2 1 16 1

bb end f5-e7 8 4 32 8 2 1 16 1

bw end f5-e7 8 4 32 8 2 1 16 1

first 8 4 32 8 2 1 16 1

mv is b f6-e7, p is b, o is f6

space f6 is b1

31 b1 b f6-e7 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

1 one bits in var b1

1000 100 100000 1000 10 1 10000 1

c1

Array
(
    [0] => a1
    [1] => b1
)

q end b f6-e7 8 4 32 8 2 1 16 1

bb end b f6-e7 8 4 32 8 2 1 16 1

bw end b f6-e7 8 4 32 8 2 1 16 1

first 8 4 32 8 2 1 16 1

mv is h1-f2, p is #p, o is h1

space h1 is h1

32 h1 h1-f2 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

1 one bits in var h1

1000 100 100000 1000 10 1 10000 1

c1

Array
(
    [0] => a1
    [1] => b1
)

q end h1-f2 8 4 32 8 2 1 16 1

bb end h1-f2 8 4 32 8 2 1 16 1

bw end h1-f2 8 4 32 8 2 1 16 1

first 8 4 32 8 2 1 16 1

mv is p f7-f5, p is p, o is f7

space f7 is p

33 p p f7-f5 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

mv is a1-e1, p is #p, o is a1

space a1 is a1

34 a1 a1-e1 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

1 one bits in var a1

1000 100 100000 1000 10 1 10000 1

c1

Array
(
    [0] => a1
    [1] => b1
)

q end a1-e1 8 4 32 8 2 1 16 1

bb end a1-e1 8 4 32 8 2 1 16 1

bw end a1-e1 8 4 32 8 2 1 16 1

first 8 4 32 8 2 1 16 1

mv is b e7-f6, p is b, o is e7

space e7 is b1

35 b1 b e7-f6 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

1 one bits in var b1

1000 100 100000 1000 10 1 10000 1

c1

Array
(
    [0] => a1
    [1] => b1
)

q end b e7-f6 8 4 32 8 2 1 16 1

bb end b e7-f6 8 4 32 8 2 1 16 1

bw end b e7-f6 8 4 32 8 2 1 16 1

first 8 4 32 8 2 1 16 1

mv is f2-d3, p is #p, o is f2

space f2 is h1

36 h1 f2-d3 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

1 one bits in var h1

1000 100 100000 1000 10 1 10000 1

c1

Array
(
    [0] => a1
    [1] => b1
)

q end f2-d3 8 4 32 8 2 1 16 1

bb end f2-d3 8 4 32 8 2 1 16 1

bw end f2-d3 8 4 32 8 2 1 16 1

first 8 4 32 8 2 1 16 1

mv is p b7-b6, p is p, o is b7

space b7 is p

37 p p b7-b6 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

mv is c2-d1, p is #p, o is c2

space c2 is c1

38 c1 c2-d1 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

1 one bits in var c1

1000 100 100000 1000 10 1 10000 1

c1

Array
(
    [0] => a1
    [1] => b1
)

q end c2-d1 8 4 32 8 2 1 16 1

bb end c2-d1 8 4 32 8 2 1 16 1

bw end c2-d1 8 4 32 8 2 1 16 1

first 8 4 32 8 2 1 16 1

mv is p c5-c4, p is p, o is c5

space c5 is p

39 p p c5-c4 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

mv is d3-e5, p is #p, o is d3

space d3 is h1

40 h1 d3-e5 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

1 one bits in var h1

1000 100 100000 1000 10 1 10000 1

c1

Array
(
    [0] => a1
    [1] => b1
)

q end d3-e5 8 4 32 8 2 1 16 1

bb end d3-e5 8 4 32 8 2 1 16 1

bw end d3-e5 8 4 32 8 2 1 16 1

first 8 4 32 8 2 1 16 1

mv is r d8-e8, p is r, o is d8

space d8 is a1

41 a1 r d8-e8 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

1 one bits in var a1

1000 100 100000 1000 10 1 10000 1

c1

Array
(
    [0] => a1
    [1] => b1
)

q end r d8-e8 8 4 32 8 2 1 16 1

bb end r d8-e8 8 4 32 8 2 1 16 1

bw end r d8-e8 8 4 32 8 2 1 16 1

first 8 4 32 8 2 1 16 1

mv is e5-f3, p is #p, o is e5

space e5 is h1

42 h1 e5-f3 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

1 one bits in var h1

1000 100 100000 1000 10 1 10000 1

c1

Array
(
    [0] => a1
    [1] => b1
)

q end e5-f3 8 4 32 8 2 1 16 1

bb end e5-f3 8 4 32 8 2 1 16 1

bw end e5-f3 8 4 32 8 2 1 16 1

first 8 4 32 8 2 1 16 1

mv is r e8-e4, p is r, o is e8

space e8 is a1

43 a1 r e8-e4 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

1 one bits in var a1

1000 100 100000 1000 10 1 10000 1

c1

Array
(
    [0] => a1
    [1] => b1
)

q end r e8-e4 8 4 32 8 2 1 16 1

bb end r e8-e4 8 4 32 8 2 1 16 1

bw end r e8-e4 8 4 32 8 2 1 16 1

first 8 4 32 8 2 1 16 1

mv is e1-e2, p is #p, o is e1

space e1 is a1

44 a1 e1-e2 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

1 one bits in var a1

1000 100 100000 1000 10 1 10000 1

c1

Array
(
    [0] => a1
    [1] => b1
)

q end e1-e2 8 4 32 8 2 1 16 1

bb end e1-e2 8 4 32 8 2 1 16 1

bw end e1-e2 8 4 32 8 2 1 16 1

first 8 4 32 8 2 1 16 1

mv is p h7-h6, p is p, o is h7

space h7 is p

45 p p h7-h6 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

mv is d1-e1, p is #p, o is d1

space d1 is c1

46 c1 d1-e1 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

1 one bits in var c1

1000 100 100000 1000 10 1 10000 1

c1

Array
(
    [0] => a1
    [1] => b1
)

q end d1-e1 8 4 32 8 2 1 16 1

bb end d1-e1 8 4 32 8 2 1 16 1

bw end d1-e1 8 4 32 8 2 1 16 1

first 8 4 32 8 2 1 16 1

mv is p g7-g5, p is p, o is g7

space g7 is p

47 p p g7-g5 8 4 32 8 2 1 16 1

1000 100 100000 1000 10 1 10000 1

Continue because mv is empty

firstrank is RBKRBNQN






Check out Atomic Chess, our featured variant for November, 2024.

Viewing Game

8 k
7 p
6 p b p
5 p p p
4 p r P
3 P P N P
2 P P R P
1 K
a b c d e f g h

Fischer Random Chess

White:
Black:



Orientation:
Scale:

Render as:
Shape:

Piece Set:

Colors:


a Fischer Random Chess problem from this position.

Rules of Fischer Random Chess

K
King
Q
Queen
R
Rook
B
Bishop
N
Knight
P
Pawn

Fischer Random Chess is played just like Chess except as follows:

Notation

You should be aware that Game Courier's notation is not identical with standard Chess notation. Game Courier has been designed for general use with any of several different Chess variants, and it accordingly uses a generic system of notation. This system is described in detail in the User's Guide. Here are the basics you need to know for Chess. Move a piece by writing its present coordinate, a hyphen, and its destination coordinate. For example, "e2-e4". There is no special operator for captures. A hyphen should be used even when a piece is captured. To signal to your opponent what piece you moved, and to provide an extra bit of error checking on the move you enter, you may include Game Courier's notation for the piece before the move. For example, "P e2-e4". Note that Game Courier uses uppercase letters for White pieces and lowercase for Black pieces. Black could enter "p e7-e5" for a move but not "P e7-e5".

This preset enforces the rules. It also automates en passant and castling. To capture by en passant, just move your Pawn to its destination. If it is a legal en passant move, your opponent's Pawn will be automatically captured.

To castle, move either your King or your Rook, but not both, to where it must go to castle. This move should be an otherwise illegal move. Either the King should move two or more spaces, or the King or Rook should hop over or capture the other. If you move your King only one space or move your Rook only across empty spaces, then your move will not count as castling. Once you have made half the castling move, the other piece will automatically move into place.

All promotions must be done explicitly. After moving your Pawn to the last rank, tack a semicolon to your Pawn move and add the new piece to the Pawn's space. For example, "P f7-f8; Q-f8".

How to Move Pieces

Full Algebraic Notation

Algebraic notation identifies each space by a coordinate that begins with its file label and ends with its rank label. On the Chess board, files go up and down from one player to the other, and ranks go from left to right. In most games, files are represented by letters, and ranks are represented by numbers, but there is no fixed rule requiring this for all games, and some games, such as Shogi, reverse this convention. If you look at the diagram, you will usually see the file labels going from left to right and the file labels going up and down. And if you hover your mouse over a space, you will normally see the name of the coordinate appear in a tooltip.

It is not uncommon to see algebraic notation being used for Chess, but it is often in an abbreviated format that requires you to know both the rules of the game and the current position to know exactly which piece moves where. For example, the notation "Ne6" indicates that a Knight is moving to e6, but it doesn't indicate which Knight, and it doesn't specify where the Knight is coming from. To figure this out, you need to know how a Knight moves and which Knight on the board can make a legal move to e6.

Although rules may be programmed for individual games, Game Courier itself does not know the rules of any game, and it is unable to parse abbreviated algebraic notation. Therefore, it relies on full algebraic notation, which completely specifies the move without requiring any knowledge of the game's rules or the current position. The most usual type of full algebraic notation indicates the piece that is moving by its label, the space it is moving from, and the space it moving to. In Chess, a typical first move might be written as "P e2-e4". When you hover your mouse over a piece, you will normally see the piece label followed by the coordinate for the space, and when you hover it over an empty space, you will normally see the coordinate label. Including the piece label in your notation allows Game Courier to check that the piece you're moving is the right one, and it makes game notation easier to follow, but it is not mandatory.

You may promote a piece by including a promotion move after your regular move. A promotion move has a piece go directly to a coordinate. Here is an example: "p e7-e8; q-e8".

You may remove a piece from a space by adding an @ to the space or by omitting the destination coordinate. For example, both "@-e4" and "e4-" would remove the piece on "e4". This is useful for en passant when you are playing a game that does not handle this automatically. For example, "P d5-e6; e5-" removes the Pawn on e5 after a Pawn moves from d5 to e6.

You will not need to remove spaces for most games, but if you should need to, you can do this by omitting the first coordinate in a move. For example, "-e4" would remove e4 from the board. To add or return a space to the board, you may add an @ or any other piece to it.

Available Pieces

Pieces are represented by labels, usually using uppercase letters for White and lowercase letter for Black. When you enter a move or specify the starting position for a game, you should remember that piece labels are case-sensitive. Many piece sets are available for use with Game Courier, and this table shows you which pieces belong to the piece set you are currently using.

The inclusion of a piece does not indicate that it is used in the game you are playing. But if your game uses pieces not included here, you should choose a different piece set.

WKnightBishop.gif
A
WBishop.gif
B
WCamel.gif
C
WWarmachine.gif
D
WElephant.gif
E
WFers.gif
F
WGrasshopper.gif
G
WHorse.gif
H
WNightrider.gif
I
WGiraffe.gif
J
WKing.gif
K
WLion.gif
L
WKnightRook.gif
M
WKnight.gif
N
WKingRook.gif
O
WPawn.gif
P
WQueen.gif
Q
WRook.gif
R
WBerlinPawn.gif
S
WAmazon.gif
T
WNightPrincess.gif
U
WVao.gif
V
WWazir.gif
W
WKnightKing.gif
X
WKingBishop.gif
Y
WZebra.gif
Z
BKnightBishop.gif
a
BBishop.gif
b
BCamel.gif
c
BWarmachine.gif
d
BElephant.gif
e
BFers.gif
f
BGrasshopper.gif
g
BHorse.gif
h
BNightrider.gif
i
BGiraffe.gif
j
BKing.gif
k
BLion.gif
l
BKnightRook.gif
m
BKnight.gif
n
BKingRook.gif
o
BPawn.gif
p
BQueen.gif
q
BRook.gif
r
BBerlinPawn.gif
s
BAmazon.gif
t
BNightPrincess.gif
u
BVao.gif
v
BWazir.gif
w
BKnightKing.gif
x
BKingBishop.gif
y
BZebra.gif
z

Credits

This preset uses the Abstract settings file for Fischer Random Chess, which was made by Fergus Duniho.

Game Courier was created, programmed and written by Fergus Duniho.

Game Courier, Copyright © Fergus Duniho, 2001-2017


WWW Page Created: 15 August 2001

Kibbitzing Etiquette

Kibbitzing is the practice of commenting on a game you are not playing. In commenting on a game, please follow these rules of etiquette.

(1) If you notice that someone has made an illegal move, please mention it. Some Game Courier presets cannot enforce rules, but Game Courier does enable players to take back any previous move. Details on how to take back a move are provided in the User's Guide, linked to above the board.

(2) Unless otherwise specifically asked to, do not offer hints or suggestions to players on what moves they should make. In general, avoid coaching comments.

(3) Once a game is over, it should be alright to offer your analysis of the game and your specific comments on what moves players should have made. If some players don't want this, they may mention it in the Kibbitzing section, and you should honor this request by not commenting on the game.

(4) Be polite. At the appropriate time, offer any criticism you have in a constructive manner. Avoid heckling players for bad moves.

(5) Don't spam this space with irrelevant comments. If you have a comment about Game Courier, rather than about the specific game you're viewing, please post it on Game Courier's Index page to give it.