Bounded Rényi-Ulam Game

For further details see https://arxiv.org/abs/2104.01664.

Results can be found in results.txt in format of tab-separated.

x0, x1: Number of elements that received NO exactly 0 or 1 times.

k: Questioner can ask a subset of ${1,\ldots,n}$ with at most $k$ elements.

question needed: Number of questions that is needed for the Questioner to find the number.

[...winning steps]: Optimal queries from that state. It is in format of q0,q1. Steps are separated with tabulator.