一种对中式台球进行摆球布局的优化算法

An Optimization Algorithm of Placement for Chinese Billiards

针对台球运动中人工摆球耗时、耗力、摆球不合理,加大人员服务成本开销的问题,提出一种对中式台球进行摆球布局的优化算法。该算法定义内外2个三角形,对子球的位置进行编号,建立数学模型并给出形式化描述,引入二叉树结构来组织所有可能的摆球布局方案,用回溯法完成对中式台球摆球布局的构造过程,最终产生一个方案库。该方案库中的摆球方案均满足任何3个及以上全色球或3个及以上花色球不相邻,确保台球摆球布局的合理性、公平性,为自动台球机的进一步设计与开发提供有效的方法。

It exists a lot of problems to place balls using artificial method in billiards sports,such as time-consuming,labor-intensive,placed unreasonable,increasing the cost of service and so on. The paper puts forward an optimization algorithm of placement for Chinese billiards. The algorithm defines inside triangle and outside triangle. The locations of the sub-balls are numbered. It constructs a mathematical model,gives a formal description,uses binary tree structure to organize all the possible layout schemes,and searches reasonable schemes by backtracking. All of these schemes meet any of the three or more non-adjacent panchromatic ball or fancy ball,they provide an effective way for the further design and development of automatic billiards machine.