Linguistic geometry approach for solving the cops and robber problem in grid environments

DOI10.1016/j.ins.2017.05.045zbMath1444.91039OpenAlexW2620657260MaRDI QIDQ778399

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

zbMATH Keywords

decision treecops and robberpursuit and evasion\(\alpha-\beta\) pruningforward estimationlinguistic geometry

Mathematics Subject Classification ID

Linguistics (91F20) Positional games (pursuit and evasion, etc.) (91A24) Algorithmic game theory and complexity (91A68)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A cops and robber game in multidimensional grids
• The capture time of grids
• The complexity of pursuit on a graph
• Cops and robber game without recharging
• A game of cops and robbers
• The capture time of a graph
• An analysis of alpha-beta pruning
• A linguistic approach to geometric reasoning
• Translations of network languages
• On the cop number of a graph
• Vertex-to-vertex pursuit in a graph
• Linguistic geometry. From search to construction
• Edge-critical cops and robber in planar graphs
• Pursuing a fast robber on a graph
• The optimal capture time of the one-cop-moves game
• A note on \(k\)-cop, \(l\)-robber games on graphs
• A simple method of computing the catch time
• Pursuit-Evasion in Models of Complex Networks
• Lazy Cops and Robbers on Hypercubes
• 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