La dificultad de jugar sudoku
Se prueba que el juego sudoku es NP -completo, si se consideran tableros de tamaño n2 para todo número natural n. Esto explica, en parte, por qué es que resulta tan difícil jugar sudoku.
Main Author: | J. Andrés Montoya |
---|---|
Format: | Article |
Language: | Spanish |
Published: |
Universidad Industrial de Santander
2006-01-01
|
Series: | Revista Integración |
Online Access: | http://www.redalyc.org/articulo.oa?id=327028430001 |
Similar Items
-
Amundsen and the Sudoku
by: Edina Kovács
Published: (2023-06-01) -
Sudoku number of graphs
by: J. Maria Jeyaseeli, et al.
Published: (2023-05-01) -
Isomorphism between Sudoku and Proof Systems and Its Application in Sudoku Solving
by: Jakub Dakowski
Published: (2022-03-01) -
Construction of Standard Solid Sudoku Cubes and 3D Sudoku Puzzles
by: Mehrab Najafian, et al.
Published: (2022-01-01) -
Jugar con la Escultura.
by: Sebastián Gámez Millán
Published: (2019-12-01)