Locate the hidden fleet of 1 battleship, 2 cruisers, 3 destroyers and 4 submarines from clues about how many ship parts can be found in each row and each column. Complete the grid such that each row, each column, and each tile contains the digits 1−6. (I have three more 6x6 jigsaw variants too: gp6t2-gp6t4): Complete the grid such that each row, each column, and each tile contains the digits 1−5. (I have five more 5x5 jigsaw variants too: gp5t2-gp5t6): Lynce, I., Ouaknine, J.: Sudoku as a SAT problem. In: Proceedings of the 9th Symposium on Artificial Intelligence and Mathematics (2006) Complete the grid such that each row, each column, and each tile in each of the three puzzles contains the digits 1−9.

Puzzle: sets up three puzzles, number 1 is average (around 20mins), 2 and 3 are hard (up to 40 mins each)SuDoku (originally Number Place) is a logic game which is very popular in Japan and became a newspaper craze in the UK in 2004/2005. Can stochastic search algorithms outperform existing deterministic heuristics for the NP-hard problemNumber Partitioning if given a sufficient, but practically realizable amount of time? In a thorough empirical investigation using a straightforward implementation of one such algorithm, simulated annealing, Johnson et al. (Ref. 1) concluded tentatively that the answer is negative. Leaflet of simple Jigsaw su doku puzzles (6 puzzles: 5x5) suitable for ages from 9 to 13. [ Answers]

van Laarhoven, P., Aarts, E.: Simulated Annealing: Theory and Applications. Reidel, Dordrecht (1987) Tip 1: Look for rows, columns of 3×3 sections that contain 5 or more numbers. Work through the remaining empty cells, trying the numbers that have not been used. In many cases, you will find numbers that can only be placed in one position considering the other numbers that are already in its row, column, and 3×3 grid. The darker coloured cell is the "current" cell. Pressing a numeric key or one of the numbered buttons

Viděli jste

Colbourn, C.J., Colbourn, M.J., Stinson, D.R.: The computational complexity of recognising critical sets. In: Graph Theory. Lecture Notes in Mathematics, vol. 1073, pp. 248–253. Springer, New York (1984) Smith, B.: Phase transitions and the mushy region in constraint satisfaction problems. In: Cohn, A. (ed.) Proceedings of the 11th European Conference on Artificial Intelligence, pp. 100–104. Wiley, New York (1994)