Complex sentence: As with Sudoku and Latin squares, many interesting questions about sufficiently complex Didokus may well be NP-complete, so no worst-case polynomial time algorithm could ever answer them.
Split into simpler sentences: As with Sudoku and Latin squares, many interesting questions about sufficiently complex Didokus may well be NP-complete. In this case there could be no worst-case polynomial time algorithm able to answer them.