user16577: The dabbaba is a '2,0' leaper fairy piece, only able to ever reach a quarter of the squares on the board. According to the linked Wikipedia page, a quartet of them can apparently "easily" force mate against a bare king with the help of their own king; however, I'm curious whether an orthodox knight could reliably hold off the dabbaba quartet. It's effectively a 7-piece endgame, just that 4 of the pieces are weaker fairy pieces; four '2,0' leapers that can each only reach a quarter of the squares on the board versus a single '2,1' leaper that can reach any square on the board.
As for the dabbaba's aforementioned restriction to a quarter of the squares on the board, a single dabbaba can reach either ACEG or BDFH files and either odd ranks or even ranks; making the 4 dabbabas of the quartet be the odd ACEG, even ACEG, odd BDFH, and even BDFH. Assuming the 4 dabbabas are to cover their respective quarters of the board, there should be ((16^4)/8)*(60!/(60-3)!)*2 meaningfully unique KDDDDvKN positions to look at minus any where side-to-move could just take the other side's king or is already checkmated by the other side.

user8201: Hi welcome to chess stackexchange. If I had a Knight surely I can trade it for one of these Daddaba guys. So a simpler question is whether KDDD can beat K. If the lone K can reach the corner where he can’t be checked, then he is safe.

user19415: I was unable to generate data for exactly what you want, but I managed something with a restriction to 6x6 board. I think it's reasonable to assume that it doesn't make a big difference from 8x8 for this specific case since there are no powerful pieces on the board (with unrestricted movement distance).
Available positions are enumerated by starting from a certain position and doing moves until we can. It should give all possible positions but I'm not sure. (I respect the requirement posed by OP that all Ds have different available positions)
Code (C++17, uses a few MSVC specific intrinsics) (tuned for this specific piece types and configuration): https://pastebin.com/d6J5WHuY
Stripped WDL data:
        W               D               L
KvK     0.000000000%    100.000000000%  0.000000000%
KDvK    0.000000000%    0.000000000%    0.000000000%
KDDvK   0.620803000%    99.379200000%   0.000000000%
KDDDvK  25.666000000%   74.334000000%   0.000000000%
KDDDDvK 69.638300000%   30.361700000%   0.000000000%
KvKN    0.000000000%    100.000000000%  0.000000000%
KDvKN   0.000761905%    99.997700000%   0.001523810%
KDDvKN  0.083948400%    99.916000000%   0.000000000%
KDDDvKN 3.553240000%    96.446800000%   0.000000000%


        Longest DTM for white   
            Longest DTM for black
KvK     0   0
KDvK    0   0
KDDvK   17  0
KDDDvK  57  0
KDDDDvK 63  0
KvKN    0   0
KDvKN   1   1
KDDvKN  17  0
KDDDvKN 63  0


I'm unable to generate KDDDDvKN as it would require ~32GiB of RAM (should take less than an hour though), which I don't have.
Buf overall it can be seen that around a quarter of KDDDvK games are winning for white which may suggest that there are non-trivial winning KDDDDvKN positions.
I also have more detailed logs with the longest winning line shown.
https://drive.google.com/drive/folders/1_aLMYB87zVJ9qslQxafTZNKHgXsoBnl2?usp=sharing
I have not added any persistence/querying and I don't plan to. Code is provided above.

16577: <p>The <a href="https://en.wikipedia.org/wiki/Dabbaba_(chess)" rel="nofollow noreferrer">dabbaba</a> is a '2,0' leaper fairy piece, only able to ever reach a quarter of the squares on the board. According to the linked Wikipedia page, a quartet of them can apparently "easily" force mate against a bare king with the help of their own king; however, I'm curious whether an orthodox knight could reliably hold off the dabbaba quartet. It's effectively a 7-piece endgame, just that 4 of the pieces are weaker fairy pieces; four '2,0' leapers that can each only reach a quarter of the squares on the board versus a single '2,1' leaper that can reach any square on the board.</p>

<p>As for the dabbaba's aforementioned restriction to a quarter of the squares on the board, a single dabbaba can reach either ACEG or BDFH files and either odd ranks or even ranks; making the 4 dabbabas of the quartet be the odd ACEG, even ACEG, odd BDFH, and even BDFH. Assuming the 4 dabbabas are to cover their respective quarters of the board, there should be ((16^4)/8)*(60!/(60-3)!)*2 meaningfully unique KDDDDvKN positions to look at minus any where side-to-move could just take the other side's king or is already checkmated by the other side.</p>
 8201: <p>Hi welcome to chess stackexchange. If I had a Knight surely I can trade it for one of these Daddaba guys. So a simpler question is whether KDDD can beat K. If the lone K can reach the corner where he can’t be checked, then he is safe.</p>
 19415: <p>I was unable to generate data for exactly what you want, but I managed something with a restriction to 6x6 board. I think it's reasonable to assume that it doesn't make a big difference from 8x8 for this specific case since there are no powerful pieces on the board (with unrestricted movement distance).</p>

<p>Available positions are enumerated by starting from a certain position and doing moves until we can. It should give all possible positions but I'm not sure. (I respect the requirement posed by OP that all Ds have different available positions)</p>

<p>Code (C++17, uses a few MSVC specific intrinsics) (tuned for this specific piece types and configuration): <a href="https://pastebin.com/d6J5WHuY" rel="nofollow noreferrer">https://pastebin.com/d6J5WHuY</a></p>

<p>Stripped WDL data:</p>

<pre><code>        W               D               L
KvK     0.000000000%    100.000000000%  0.000000000%
KDvK    0.000000000%    0.000000000%    0.000000000%
KDDvK   0.620803000%    99.379200000%   0.000000000%
KDDDvK  25.666000000%   74.334000000%   0.000000000%
KDDDDvK 69.638300000%   30.361700000%   0.000000000%
KvKN    0.000000000%    100.000000000%  0.000000000%
KDvKN   0.000761905%    99.997700000%   0.001523810%
KDDvKN  0.083948400%    99.916000000%   0.000000000%
KDDDvKN 3.553240000%    96.446800000%   0.000000000%
</code></pre>

<p><a href="https://i.stack.imgur.com/y28G3.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/y28G3.png" alt="enter image description here"></a></p>

<pre><code>        Longest DTM for white   
            Longest DTM for black
KvK     0   0
KDvK    0   0
KDDvK   17  0
KDDDvK  57  0
KDDDDvK 63  0
KvKN    0   0
KDvKN   1   1
KDDvKN  17  0
KDDDvKN 63  0
</code></pre>

<p><a href="https://i.stack.imgur.com/nqZkc.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/nqZkc.png" alt="enter image description here"></a></p>

<p>I'm unable to generate KDDDDvKN as it would require ~32GiB of RAM (should take less than an hour though), which I don't have.</p>

<p>Buf overall it can be seen that around a quarter of KDDDvK games are winning for white which may suggest that there are non-trivial winning KDDDDvKN positions.</p>

<p>I also have more detailed logs with the longest winning line shown.
<a href="https://drive.google.com/drive/folders/1_aLMYB87zVJ9qslQxafTZNKHgXsoBnl2?usp=sharing" rel="nofollow noreferrer">https://drive.google.com/drive/folders/1_aLMYB87zVJ9qslQxafTZNKHgXsoBnl2?usp=sharing</a></p>

<p>I have not added any persistence/querying and I don't plan to. Code is provided above.</p>
