# .font: font.text_2
2018-04-11 19:09 nesdori  
# .font: font.text_1
lots of unnecessary dirt removed so less combinations to try :)

# .font: font.text_2
2018-04-12 20:47 Arno  
# .font: font.text_1
i tried many possibilities and even more i did not try...   
perhaps we need an ai bot for this cave...   
or  krissz  could write a routine to test all possibilities. with 100 tests per second it would run for 15 days...  :-)

# .font: font.text_2
2018-04-12 21:22 nesdori  
# .font: font.text_1
at the rate of 100 checks / seconds the original "beyond x" would take 23 millions years to run completely. so this easier version indeed is easier.. :)

# .font: font.text_2
2018-04-12 21:55 nesdori  
# .font: font.text_1
while talking about computational complexity; i have sometimes wondered if boulder dash is np-complete so it would be possible to build a cave to represent any nondeterministic polynomial time problem. like it has been proved that minesweeper is np-complete:  
  
<a href="http://simon.bailey.at/random/kaye.minesweeper.pdf" target="external">http://simon.bailey.at/random/kaye.minesweeper.pdf</a>

# .font: font.text_2
2018-04-13 11:53 Arno  
# .font: font.text_1
interesting stuff! :-)  
  
about this cave: just to be sure, have you tested it? so we know that a solution exists at all?   
if yes, could you give a hint, or reduce more dirt? thx! :-)

# .font: font.text_2
2018-04-13 15:32 nesdori  
# .font: font.text_1
my caves are always tested. i made a new version which has additional hints.