Helpmate tablebases Every solution to every position, precomputed.

← all materials

KRvkrp

5 pieces.

h#7.5
longest mate
h#6
deepest unique
175
positions at that depth
h#6
deepest dual
h#6
deepest strict dual
483,044,666
positions with a helpmate
19,788,960
with a unique solution
355,074,048
cells in the plane
168,783,041 bytes
on disk

Deepest unique problems

h#6

8/8/7k/8/8/8/p1r5/K6R b - - 0 1

  1. Kg5 Rb1 Kf4 Rb2 Ke3 Kxa2 Kd2 Kb3 Kc1 Ra2 Rd2 Ra1#

pure model ideal self-block nocheck

Note: the side to move is in check in the diagram.

Deepest dual problems

Only one distinct idea exists at this depth: 2 positions share a solution.

h#6

K7/8/8/1r6/8/8/2p1Rk2/8 b - - 0 1

Two solutions, with different first and last moves (2 starts, 2 ends).

  1. Kf1 Ka7 Rg5 Kb6 Rg1 Kc5 c1=N Kd4 Nd3 Ke3 Ne1 Rf2#
  2. Kg1 Ka7 Rg5 Kb6 Rg2 Kc5 c1=Q+ Kd4 Qc7 Ke3 Qh2 Re1#

pure model ideal promotion underpromotion self-block nocapture

Note: the side to move is in check in the diagram.