New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

带癞子的拆分胡牌算法应该如何解决？ #20

Open

feihuroger opened this issue Oct 10, 2017 · 2 comments

feihuroger commented Oct 10, 2017 •

edited

Loading

把每个癞子可能的花色，替换上去，再用分拆法吗？
这样就有 27 * 27 * 27 * 27种可能？（不考虑风的情况）

Owner

yuanfengyun commented Oct 10, 2017

不多说，直接看代码https://github.com/yuanfengyun/qipai/tree/master/mjlib_c%2B%2B/split

Author

feihuroger commented Oct 11, 2017

谢谢。

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment