The number of pessimistic guesses in Generalized Black-peg Mastermind

Mastermind is a famous 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 using information he receives from the codemaker after each guess. In Generalized Black-peg Mastermind for given arbitrary numbers p, c, the secret code consists of p pegs each having one of c colors, and the received information consists only of a number of black pegs, where this number equals the number of pegs matching in the corresponding question and the secret code. Let b(p,c) be the pessimistic number of questions for Generalized Black-peg Mastermind. By a computer program we compute several values b(p,c). By introducing some auxiliary games and combining this program with theoretical methods, for arbitrary c we obtain exact formulas for b(2,c), b(3,c) and b(4,c) and give upper and lower bounds for b(5,c) and a lower bound for b(6,c). Furthermore, for arbitrary p, we present upper bounds for b(p,2), b(p,3) and b(p,4). Finally, we give bounds for the general case b(p,c). In particular, we improve an upper bound recently proved by Goodrich.     

Efficient solutions for Mastermind using genetic algorithms

We present a new genetic algorithm for playing the game of Mastermind. The algorithm requires low run-times and results in a low expected number of guesses. Its performance is comparable to that of other meta-heuristics for the standard setting with four positions and six colors, while it outperforms the existing algorithms when more colors and positions are examined. The central idea underlying the algorithm is the creation of a large set of eligible guesses collected throughout the different generations of the genetic algorithm, the quality of each of which is subsequently determined based on a comparison with a selection of elements of the set.     

The number of pessimistic guesses in Generalized Mastermind

Mastermind is a famous 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. The code consists of 4 pegs, each of which is one of 6 colors. In Generalized Mastermind a general number p of pegs and a general number c of colors is considered. Let f(p,c) be the pessimistic number of questions for the generalization of Mastermind with an arbitrary number p of pegs and c of colors. By a computer program we compute ten new values of f(p,c). Combining this program with theoretical methods, we compute all values f(3,c) and a tight lower and upper bound for f(4,c). For f(p,2) we give an upper bound and a lower bound. Finally, combining results for fixed p and c, we give bounds for the general case f(p,c).     

预则立，巧预则通——论以开发项目为导向的城市设计策划

该文初步讨论了以开发项目为导向的城市设计策划的基本概念、重点内容、操作程序和成果要点,并指出：城市设计策划应当兼顾城市公共利益要求和市场开发需求,以“项目化”和“行动化”作为主线,对后续的方案设计组织、成果导控体系编制、开发实施行动策略进行预先计划与安排。     

规划方案设计多轮竞标分阶段实施的探讨

通过“武夷绿洲”总平规划方案设计进行三轮竞标 ,并分阶段实施的实践。探讨如何策划规划理念、提升规划方案设计品质和操作方法与步骤