Trivia item: 58 5-1p zugs in a Knight's tour crocodile ...

Endgame analysis using tablebases, EGTB generation, exchange, sharing, discussions, etc..
Post Reply
guyhaw
Posts: 489
Joined: Sat Jan 21, 2006 10:43 am
Sign-up code: 10159
Location: Reading, UK
Contact:

Trivia item: 58 5-1p zugs in a Knight's tour crocodile ...

Post by guyhaw »

... the 58 (6-man 5-1p K(Q/R/B)NPPK zugs in a Knight's tour:

e.g. 5NKQ/4k1PP/8/8/8/8/8/8 w … (a wtm draw but a btm win) ... the bK shuttles e7/e8 to keep the White force (including a Q, R or B) pinned in the corner and the wN is always on the wrong foot:

(wN on f8) – Ng6 – Nh4 – Ng2 – Ne1 – Nc2 – Na1 – Nb3 – Na5 – Nb7 {10} – Nd8 – Nf7 – Nh6 – Ng4 – Nh2 – Nf1 – Nd2 – Nb1 – Na3 – Nb5 {20 squares} -
Na7 – Nc8 – Nd6 – Nc4 – Nb2 – Na4 – Nb6 – Na8 – Nc7 – Na6 {30} – Nb8 – Nc6 – Nb4 – Na2 – Nc1 – Ne2 – Ng1 – Nh3 – Ng5 – Nf3 {40 squares} –
Nd4 – Nf5 – Ne3 – Nd1 - Nf2 - Nh1 - Ng3 - Nh5 - Nf6 - Nd7 {50} - Ne5 - Nd3 - Nf4 - Nd5 - Nc3 - Ne4 - Nc5 - Ne6 {- Nf8 !!}


I think I applied the 'go to square with least exits' rule consistently. What is a 'greedy algorithm' and why do they tend to work?!

I suppose if it hadn't worked, I'd back up to a decision where there were two squares with the same number of exits.

Am not having the same success with the 60 zugs in KNPK yet, e.g. 6NK/5k1P/8/8/8/8/8/8 w etc.

Guy
Post Reply