-
Notifications
You must be signed in to change notification settings - Fork 3
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
Develop a C-based Solver with BFS #28
Comments
Additional project, could be done later, use SIMD instructions to parallelize the solve.
|
Update on issue, successfully tried a C-based extension onto Hanoi. Seems very hard to parallelize BFS however, needs more research. View ants/hanoic branch for more info. |
Unfortunately, binary extensions (CPython extensions) are very hard to maintain between operating systems as outlined in this (albeit incomplete) guide for binary extensions https://packaging.python.org/guides/packaging-binary-extensions. There are many ways we can approach this issue:
Either way this issue will be closed with another issue and discontinued. |
C code is usually faster than Python code, but we can extend Python code using C based extensions. Find a way to implement a C based solver using the standard BFS algorithm, while also conforming to the solver model.
Minimum prereqs: Knowledge of the C language and/or CS61C
Article on C based Python extensions
The text was updated successfully, but these errors were encountered: