Mastermind
From MaRDI portal
Publication:753814
DOI10.1007/BF02579188zbMath0717.05002OpenAlexW4236316415MaRDI QIDQ753814
Publication date: 1983
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579188
Related Items (78)
All metric bases and fault-tolerant metric dimension for square of grid ⋮ Some family of distance pattern distinguishing graphs and realization results ⋮ On some applications related with algebraic structures through different well known graphs ⋮ Bounds on the domination number and the metric dimension of co-normal product of graphs ⋮ Fractional metric dimension of generalized prism graph ⋮ On the bounded partition dimension of some classes of convex polytopes ⋮ Bounds on the sum of domination number and metric dimension of graphs ⋮ On the query complexity of black-peg AB-mastermind ⋮ Metric dimension of some distance-regular graphs ⋮ Resolving sets tolerant to failures in three-dimensional grids ⋮ Minimum partition of an \(r\)-independence system ⋮ The \(k\)-metric dimension ⋮ Metric dimension and edge metric dimension of windmill graphs ⋮ Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory ⋮ Fault-tolerant strong metric dimension of graphs ⋮ Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications ⋮ On the metric determination of linear dependence graph ⋮ On mixed metric dimension of crystal cubic carbon structure ⋮ Extremal Graph Theory for Metric Dimension and Diameter ⋮ On metric dimension of nonbinary Hamming spaces ⋮ Query complexity of mastermind variants ⋮ Metric dimension of Andrásfai graphs ⋮ The fractional metric dimension of graphs ⋮ An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs ⋮ On the metric dimension of Cartesian powers of a graph ⋮ On weak metric dimension of digraphs ⋮ New bounds and constructions for neighbor-locating colorings of graphs ⋮ Optimal schemes for combinatorial query problems with integer feedback ⋮ Finding a hidden code by asking questions ⋮ Fault-tolerant resolvability of some graphs of convex polytopes ⋮ Unnamed Item ⋮ Partition dimension of COVID antiviral drug structures ⋮ The number of pessimistic guesses in generalized black-peg mastermind ⋮ On graphs of order \(n\) with metric dimension \(n-4\) ⋮ Tight Lower Bounds for the Complexity of Multicoloring ⋮ Unnamed Item ⋮ Approximation complexity of metric dimension problem ⋮ Fault-tolerant metric dimension of generalized wheels and convex polytopes ⋮ On the geodesic identification of vertices in convex plane graphs ⋮ On the metric dimension of a zero-divisor graph ⋮ The exact query complexity of yes-no permutation mastermind ⋮ On the upper bounds of fractional metric dimension of symmetric networks ⋮ On Approximation Complexity of Metric Dimension Problem ⋮ Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension ⋮ Sharp bounds for partition dimension of generalized Möbius ladders ⋮ The (weighted) metric dimension of graphs: hard and easy cases ⋮ The query complexity of a permutation-based variant of mastermind ⋮ On the metric dimension of incidence graphs ⋮ The weighted 2-metric dimension of trees in the non-landmarks model ⋮ Reducing the arity in unbiased black-box complexity ⋮ Ranking-based black-box complexity ⋮ Guessing bank PINs by winning a mastermind game ⋮ Playing mastermind with constant-size memory ⋮ On the metric dimension of infinite graphs ⋮ An analytic tableaux model for Deductive Mastermind empirically tested with a massively used online learning system ⋮ Conformant plans and beyond: principles and complexity ⋮ The fractional metric dimension of permutation graphs ⋮ On the algorithmic complexity of the Mastermind game with black-peg results ⋮ The metric dimension of \(\mathbb{Z}_n \times \mathbb{Z}_n \times \mathbb{Z}_n\) is \(\lfloor 3n/2 \rfloor \) ⋮ On the strong metric dimension of tetrahedral diamond lattice ⋮ On the metric dimension of the folded \(n\)-cube ⋮ Computation of the double metric dimension in convex polytopes ⋮ Unnamed Item ⋮ Low-dimensional representation of genomic sequences ⋮ A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem ⋮ Annihilating-ideal graphs of commutative rings ⋮ Solving static permutation mastermind using \(O(n \log n)\) queries ⋮ On the Metric Dimension of Infinite Graphs ⋮ On metric dimension of plane graphs with \(\frac{m}{2}\) number of 10 sided faces ⋮ The Query Complexity of Finding a Hidden Permutation ⋮ Computing metric dimension and metric basis of 2D lattice of alpha-boron nanotubes ⋮ On graphs with same metric and upper dimension ⋮ The worst case number of questions in generalized AB game with and without white-peg answers ⋮ Metric dimension of ideal-intersection graph of the ring Zn ⋮ Computing the metric dimension for chain graphs ⋮ Completeness-resolvable graphs ⋮ The fractional k-metric dimension of graphs ⋮ Bounding memory for Mastermind might not make it harder
Cites Work
This page was built for publication: Mastermind
