Efficient algorithms for Battleship (Q6487578)
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 7651014
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for Battleship |
scientific article; zbMATH DE number 7651014 |
Statements
Efficient algorithms for Battleship (English)
0 references
7 February 2023
0 references
polyomino
0 references
digital geometry
0 references
decision tree
0 references
lattice
0 references
HV-convexity
0 references
convexity
0 references
0.7929015159606934
0 references
0.6518802642822266
0 references
0.6426916718482971
0 references
0.6347405910491943
0 references
0.6347405910491943
0 references
