Ricochet Robots game: complexity analysis Technical Report - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2019

Ricochet Robots game: complexity analysis Technical Report

Résumé

This paper investigates the Ricochet Robots game problem from a complexity standpoint. The problem consists in moving robots in a grid game board in horizontal or vertical direction only, to reach specific target tiles. Once a robot starts moving in a direction, it cannot be stopped until being blocked by a wall or another robot. We show that the optimization problem corresponding to this game is Poly-APX-hard. We also show that the decision problem is PSPACE-complete when we consider an arbitrary number of robots. In such a context, several lower bounds are introduced, exploring some classic complexity hypothesis (P = N P, ET H,. . .).
Fichier principal
Vignette du fichier
Ricochet_Robots_complexity_analysis.pdf (446.68 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02191102 , version 1 (23-07-2019)

Identifiants

  • HAL Id : hal-02191102 , version 1

Citer

Samuel Masseport, Benoit Darties, Rodolphe Giroudeau, Jorick Lartigau. Ricochet Robots game: complexity analysis Technical Report. 2019. ⟨hal-02191102⟩
151 Consultations
764 Téléchargements

Partager

Gmail Facebook X LinkedIn More