Skip to content
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

在不管花色，只管放置順序的情況下，有可能窮舉所有的洗牌方式嗎？ #5

Open
xwc2021 opened this issue Apr 19, 2018 · 1 comment
Open

在不管花色，只管放置順序的情況下，有可能窮舉所有的洗牌方式嗎？ #5

xwc2021 opened this issue Apr 19, 2018 · 1 comment

Comments

@xwc2021
Copy link
Owner

xwc2021 commented Apr 19, 2018

比如說，一開始放置的對子是1跟1，接著的對子就是2跟2，最後的對子是n跟n。
到底有多少種可行的放法？有辦法在跑程式前就估算放法的數目嗎？
@xwc2021 xwc2021 changed the title 在不管花色，只管放置順序的情況下，有可能窮舉所有的洗牌的方式嗎？ 在不管花色，只管放置順序的情況下，有可能窮舉所有的洗牌方式嗎？ Apr 19, 2018
@xwc2021
Copy link
Owner Author

xwc2021 commented Apr 19, 2018 •
edited
Loading

可能的估算方式
https://plus.google.com/u/0/+XiangweiChiou/posts/ejrsszcAn87

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@xwc2021