User Portlet
Featured Contributor
| Discussions |
|---|
| Thanks, looks like you caught a typo. The hang is there because the maze data becomes too large to compute (it might be nice to add a message if not rethinking the computation). The code changed above works, but it only required changing one integer... |
| In recent explorations how to generate randomness from physical systems consisting of massive disks bouncing around according to typical conservation laws, we've encountered difficult corner cases quite unlike the usual low density limit. The purpose... |
| Thanks again, Moderation Team! It's nice to be appreciated, so here's a little Encore just for all the snowflake lovers out there: ![enter image description here][1] Even after posting more than 50 of these, the results are nowhere close to... |
| This game would probably be easier to play if you replaced buttons with arrow keys. We figured out how to do this at summer school earlier this year, and Keying wrote some of it up: [Maze Exploring Game][1]. I just finished coding a rough preliminary... |
| Even though chess is much too difficult to analyze by comprehensive combinatorics, it's at least a relatively simple game in terms of implements. A typical chess set has only 32 pieces in six classes and two colors. Those pieces move on a flat board,... |
| Hi Isabel, nice post. If you want to make it more physical, it's not easy, but there are definitely options for doing so. One typical starting place, you may already know, is the hanging chain (see [this article][1] on the St. Louis Arch). ... |
| Yes, of course there's some variance to be expected, but typically I've seen a fairly constant rate of results generation. The "proving completion" effect at the end of a calculation is very startling and easy to notice because the time lag can be... |
| Congrats, Shuheng, and thanks for putting in the work this month. How about making a semi-final revision of the underlying topological graphs and submitting them to WFR? |
| Hey, thanks again! Trying to set a good example here. I left my computer on to run an experiment for about an hour and a half, testing $6 \times 6$ knight's tours up to a minute time constrained. In this data there were 87 instances of $Aborted, and... |
| Hey, thanks for the award! But perhaps we're moving too fast? The previous code doesn't do depth-first searching, and we haven't even solve the eight queens puzzle yet! Let's keep going on this one... There is a [BacktrackSearch][1] available... |