Efficient algorithms for Battleship

DOI10.4230/LIPICS.FUN.2021.11MaRDI QIDQ6487578zbMATH OpenFDO

Authors Loïc Crombez, Guilherme D. Da Fonseca, Yan Gerard

Publication date 7 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.FUN.2021.11

zbMATH Keywords

convexitydecision treedigital geometryHV-convexitylatticepolyomino

Mathematics Subject Classification ID

Polyominoes (05B50) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05) Combinatorial games (91A46)

Recommendations

• How to find a battleship
• Finding hidden independent sets in interval graphs
• Finding hidden independent sets in interval graphs
• On minimum-area hulls
• An Algorithm for Heilbronn's Problem

Cited in

(1)

• How to find a battleship

This page was built for publication: Efficient algorithms for Battleship

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487578)