avgBullsCows

我想试试这棵树

http://slovesnov.users.sourceforge.net/index.php?bullscows_tree,english,avgBullsCows

这棵树的生成脚本

http://slovesnov.users.sourceforge.net/scripts/bullscows.js

整个脚本文件 1000+ 行, 就不贴了
复制代码

avgBullsCows

回复 74# 523066680

An secret number for bulls-cows game can be four-place decimal with different
digits from 0 to 9. Total amount of secret numbers is 10!/6! = 5040. For
mastermind secret number is four-place digital with digits from 0 to 5. Digits
can repeat. So total amount of secret numbers is 6^4 = 1296. In common case
such games have three parameters - number of positions, number of different
digits and repeatability (1 - yes, 0 -no). From this point of view bulls-cows game
has parameters (4, 10, 0), mastermind has parameters (4, 6, 1). Optimization
of two game types has two directions.
复制代码

我的理解是 bulls-cows 游戏是 参数描述(4, 10, 0) 4个位置, 10个符号, 符号不可重复
mastermind 参数描述(4, 6, 1) 4个位置, 6个符号, 符号可重复

不论哪种游戏, 算法优化有两个目标方向

 The goal is to find algorithm which minimizes amount of secret numbers which algorithm can guess ...
复制代码

crush 算法的优化目标, 搜索树空间回合总数最小化

 The second criterion is minimize average amount of turns for guess arbitrary secret number - minimal average game length
复制代码

avg 算法的优化目标, 平均搜索回合数(平均游戏长度)最小化