12 citations · 13 across the 4 of their papers we have counts for
4 papers
Algorithm to Prove Formulas for the Expected Number of Questions in Mastermind Games
Marcin Peczarski
We close the gap in the proof (published by Chen and Lin) of formulas for the minimum number of questions required in the expected case for Mastermind and its variant called AB gam…
The Worst Case Number of Questions in Generalized AB Game with and without White-peg Answers
Gerold Jäger, Marcin Peczarski
The AB game is a two-player game, where the codemaker has to choose a secret code and the codebreaker has to guess it in as few questions as possible. It is a variant of the famous…
Towards Optimal Sorting of 16 Elements
Marcin Peczarski
One of the fundamental problem in the theory of sorting is to find the pessimistic number of comparisons sufficient to sort a given number of elements. Currently 16 is the lowest n…
Strategy in Ulam's Game and Tree Code Give Error-Resistant Protocols
Marcin Peczarski
We present a new approach to construction of protocols which are proof against communication errors. The construction is based on a generalization of the well known Ulam's game. We…