Coding Games and Programming Challenges to Code Better
Send your feedback or ask for help here!
Coding Games and Programming Challenges to Code Better
Send your feedback or ask for help here!
Fun puzzle, but, for idiots like me who mistakenly hardcoded the fact that our colour was black and enemy’s was white, there could be a test where we are white, instead of failing at the validators ![]()
What does make this puzzle a medium difficulty?
Isn’t it a bit weird to have an impossible board state as the only actual test case? I was questioning whether I should be checking for all sandwiches or only ones that were a direct result of the move and found that monstrosity. Given that board state, it opens up the question, if a piece that is sandwiched creates a new sandwich once it changes, do we apply the new sandwich as well (and any subsequent sandwiches? mmm subsequent sandwiches…). It would also be good to clarify in the examples list that a sandwich can’t contain a ‘-’.