We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. If it links a repository, it is listed below.
This paper presents an optimal strategy for solving the 4 peg-7 color Mastermind MM(4,7) in the expected case (4.676) along with optimal strategies or upper bounds for other values. The program developed is using a depth-first branch and bound algorithm relying on tight upper bound, dynamic lower bound evaluation and guess equivalence to prune symmetric tree branches.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1305.1010")
get_code_for_paper("1305.1010")
have("1305.1010")
Connect an agent — have() is free.