Efficient Algorithms for Battleship - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

Efficient Algorithms for Battleship

Résumé

We consider an algorithmic problem inspired by the Battleship game. In the variant of the problem that we investigate, there is a unique ship of shape S ⊂ Z 2 which has been translated in the lattice Z 2. We assume that a player has already hit the ship with a first shot and the goal is to sink the ship using as few shots as possible, that is, by minimizing the number of missed shots. While the player knows the shape S, which position of S has been hit is not known. Given a shape S of n lattice points, the minimum number of misses that can be achieved in the worst case by any algorithm is called the Battleship complexity of the shape S and denoted c(S). We prove three bounds on c(S), each considering a different class of shapes. First, we have c(S) ≤ n − 1 for arbitrary shapes and the bound is tight for parallelogram-free shapes. Second, we provide an algorithm that shows that c(S) = O(log n) if S is an HV-convex polyomino. Third, we provide an algorithm that shows that c(S) = O(log log n) if S is a digital convex set. This last result is obtained through a novel discrete version of the Blaschke-Lebesgue inequality relating the area and the width of any convex body.
Fichier principal
Vignette du fichier
battleship_conf.pdf (1.65 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03559058 , version 1 (05-02-2022)

Identifiants

  • HAL Id : hal-03559058 , version 1

Citer

Loïc Crombez, Guilherme D da Fonseca, Yan Gérard. Efficient Algorithms for Battleship. 10th International Conference on Fun with Algorithms (FUN 2021), Jul 2021, Sicily, Italy. ⟨hal-03559058⟩
90 Consultations
24 Téléchargements

Partager

Gmail Facebook X LinkedIn More