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.

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

This particular toy example's suitability for distributed computing #2

Open
zougloub opened this issue Jan 6, 2023 · 0 comments
Open

Comments

@zougloub
Copy link

zougloub commented Jan 6, 2023

Since this is a Red Hat repository, I would advocate to insist on the fact that effective algorithms should be candidate for distributed computing, to minimize "environmental unfriendliness".

It should be noted that a backtracking algorithm such as Jan Sipke van der Veen's is not the fastest at finding Yasumi exact cover solutions (but it can find other solutions). So much that the performance of Knuth's DLX algorithm is much faster (the 9356 solutions are found in 36 Gcycles / 8 seconds on 1 core of my laptop).

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant