Linguistic geometry approach for solving the cops and robber problem in grid environments
DOI10.1016/J.INS.2017.05.045zbMATH Open1444.91039OpenAlexW2620657260MaRDI QIDQ778399FDOQ778399
Ellips Masehian, Alireza Maddahi
Publication date: 2 July 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2017.05.045
Recommendations
decision treecops and robberpursuit and evasion\(\alpha-\beta\) pruningforward estimationlinguistic geometry
Positional games (pursuit and evasion, etc.) (91A24) Linguistics (91F20) Algorithmic game theory and complexity (91A68)
Cites Work
- The capture time of a graph
- On the cop number of a graph
- Vertex-to-vertex pursuit in a graph
- A note on \(k\)-cop, \(l\)-robber games on graphs
- Pursuit-Evasion in Models of Complex Networks
- Title not available (Why is that?)
- A game of cops and robbers
- An analysis of alpha-beta pruning
- Variations of cops and robber on the hypercube
- Title not available (Why is that?)
- Pursuing a fast robber on a graph
- Lazy Cops and Robbers on Hypercubes
- Searching and sweeping graphs: a brief survey
- Title not available (Why is that?)
- The complexity of pursuit on a graph
- Title not available (Why is that?)
- A cops and robber game in multidimensional grids
- The capture time of grids
- Cops and robber game without recharging
- A linguistic approach to geometric reasoning
- Translations of network languages
- Linguistic geometry. From search to construction
- Edge-critical cops and robber in planar graphs
- The optimal capture time of the one-cop-moves game
- A simple method of computing the catch time
- Vision-Based Pursuit-Evasion in a Grid
This page was built for publication: Linguistic geometry approach for solving the cops and robber problem in grid environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q778399)
