NP-completeness of two pencil puzzles: Yajilin and Country Road (Q4898148)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6119655
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-completeness of two pencil puzzles: Yajilin and Country Road |
scientific article; zbMATH DE number 6119655 |
Statements
29 December 2012
0 references
NP-hardness
0 references
puzzles
0 references
Yajilin
0 references
Country Road
0 references
0.8418766260147095
0 references
0.8203840851783752
0 references
0.8133700489997864
0 references
0.8091754913330078
0 references
0.7953607439994812
0 references
