![]() |
![]() |
#1 |
"Composite as Heck"
Oct 2017
761 Posts |
![]()
There can be up to 9 queens if all pawns promote, both kings have to be present and the opponents king cannot be in check as it's the start of your turn.
Naively there's an upper bound of 321, the sum of the highest move count of all pieces assuming 9 queens and all pieces are in impossibly optimal positions with nothing obstructing anything else. One of the 8 queens solutions has 182 possible moves, adding kings and blockers to fulfill the above rules gives a lower bound of 173. I could post this in the puzzle section, but as I don't know the answer that would be cheeky. |
![]() |
![]() |
![]() |
#2 |
"Robert Gerbicz"
Oct 2005
Hungary
2·7·103 Posts |
![]() |
![]() |
![]() |
![]() |
#3 |
"Composite as Heck"
Oct 2017
13718 Posts |
![]()
Thank you, my searching skills failed and DDG didn't even suggest any stack exchange links. These both increase the lower bound to 218:
Code:
R6R/3Q4/1Q4Q1/4Q3/2Q4Q/Q4Q2/pp1Q4/kBNN1KB1 w - - 0 1 3Q4/1Q4Q1/4Q3/2Q4R/Q4Q2/3Q4/1Q4Rp/1K1BBNNk w - - 0 1 |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Vote chess game 4: To be decided? Some chess variant will be interesting to consider with! | Raman | Chess | 6 | 2016-12-06 06:50 |
Turn off GCC sse-using optimizations? | ewmayer | Programming | 3 | 2016-09-30 07:15 |
Towers of Hanoi with random moves | m_f_h | Puzzles | 10 | 2013-10-10 04:17 |
Commons Moves to Erode Nobles’ Power in Britain | ewmayer | Lounge | 4 | 2007-03-08 20:31 |
4 checkins in a single calendar month from a single computer | Gary Edstrom | Lounge | 7 | 2003-01-13 22:35 |