Browsing projects by Tag(s)

Select a tag to browse associated projects and drill deeper into the tag cloud.

Showing page 1 of 1

The Crackling Fire benchmark brute-forces all the valid states of a 27-segment wooden folding puzzle (finding the two solutions in the process). At the time of this writing, a sequential C implementation is provided along with two ports: concurrent Java with Fork/Join, and concurrent Erlang. An illustration of the unfolded puzzle:

0
 
  0 reviews  |  0 users  |  753 lines of code  |  0 current contributors  |  Analyzed 6 days ago
 
 
 
 

Creative Commons License Copyright © 2013 Black Duck Software, Inc. and its contributors, Some Rights Reserved. Unless otherwise marked, this work is licensed under a Creative Commons Attribution 3.0 Unported License . Ohloh ® and the Ohloh logo are trademarks of Black Duck Software, Inc. in the United States and/or other jurisdictions. All other trademarks are the property of their respective holders.