Please note: the intended tone of this question is an "Are you sure? (Y/N)". It doesn't have the flavor "do anything differently".
The problem emerged with this question, having currently at least one deleted answer(s) (what is invisible for users below 2000).
The most relevant win criteria of the puzzle is the algorithmical complexity of the solution.
An answer using Mathematica was posted, making the algorithmical complexity of the solution depending heavily on the internal algorithms used by this software. These are not enough well known, and practically unknowable, because Mathematica is a closed-source software.
However, the solution seemed a quite interesting one for me, and maybe also for others (it got multiple ups).
Accepting the situation, the poster declared the solution as non-competing.
Despite that, it was deleted by community votes.
I think, also non-competing or undecidable answers improve the site. However, it would be probably not useful to have a large mass of non-competing, unanswerable answers. Furthermore, the primary goal of the site may be to collect mainly competing answers to the puzzles.