组合型非攻击乘子的界
Bounds for Combinatorial Types of Non-Attacking Riders
摘要:
给定q个非攻击骑手的r个移动,对于r大于2和q大于3,尚未发现组合类型的数量。本文的目的是创建上界和下界函数,可以适用于任何q和r,无论大小。
英文摘要:
Given q non-attacking riders with r moves, the number of combinatorial types has not been found for r greater than 2 and q greater than 3. This paper aims to create upper and lower bound functions which can be applied to any q and r, regardless of size.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。