I've been thinking about hnefatafl problems for a long time now, since before crust's thread on the subject. I've looked into it a bit more deeply in the last couple of weeks. I knew would be difficult, but its difficulty surpassed even my expectations! After about three hours and as many failed attempts, this is what I've come up with. It uses Linnaeus' tablut rules as in the recent tournament.
Code: Select all
9 - - - - - A - - - 8 - - A - - - - - - 7 D - A - - - - - - 6 A - - - - - - - - 5 - - - D + - A - - 4 D - - K - D A - A 3 - D A - A - - - - 2 - - - - - - - - - 1 - - - A - - - - - A B C D E F G H I
It's the turn of the king's side, who will move three times before the attackers resign. What are those three moves, and the attackers' responses? I'm not expecting it to be very taxing for people here, but I'm hoping that there is only one solution - and that there isn't a quicker victory for the king!
A prettier version of this is due to appear on my social media feeds tomorrow, unless someone finds a problem (ha ha) with it.