jamis

8 ms·

31.
by jamis 11y ago
Absolutely. Which is all the more reason why holding those ideas close is silly. Get some practice making those ideas real, and learn how to execute on something well.
32.
Ideas are Cheap(weblog.jamisbuck.org)
67 points by jamis 11y ago|63 comments
33.
“Mazes for Programmers” – code your own twisty little passages(youtube.com)
1 points by jamis 11y ago|0 comments
34.
Mazoo - How many mazes can you get finish in 60 seconds?(mazoo.jamisbuck.org)
1 points by jamis 11y ago|0 comments
35.
Woman creates custom exoskeletal support for her broken hand with a 3Doodler(the3doodler.com)
4 points by jamis 12y ago|0 comments
36.
PEAK: an intriguing approach to diversification in education(collegeofidaho.edu)
1 points by jamis 12y ago|0 comments
37.
Basil and Fabian – Teaching pathfinding algorithms through story(blog.jamisbuck.org)
2 points by jamis 12y ago|0 comments
38.
by jamis 12y ago
I love the idea of constrained mazes like this. Another related idea is that of "plank puzzles" ( http://www.clickmazes.com/planks/ixplanks.htm ), which constrain available moves based on which planks you curre
39.
Building algorithm intuition through stories: introducing Basil and Fabian(blog.jamisbuck.org)
2 points by jamis 12y ago|0 comments
40.
by jamis 15y ago
The slides presentation was built on top of deck.js ( http://imakewebthings.github.com/deck.js/ ).
41.
by jamis 15y ago
Our problem here is the overloaded nature of the word "play". I do not disagree that children learn through play. But I'm using the word differently in my presentation: I'm using it to refer to activities that you (as an adult) pursue casua
42.
by jamis 15y ago
I definitely was not recommending constant practice--I agree that doing so will hurt you more than it helps you! I was recommending consistently regular practice.
43.
by jamis 15y ago
My intent was definitely not to portray learning as painful. Learning is a joyful thing. But it's not something you can acquire by passively staring at the world. You need to exert yourself if you want to do more than gain a passing acquain
44.
by jamis 16y ago
For me, it is interesting because fairly simple means can produce complex (and to me, beautiful) results. It's intrigues me to explore this and see what can be done with it. It is also particularly interesting to me as a way to explore the
45.
by jamis 16y ago
Nearly all of the algorithms I described extend well into multiple dimensions. I'm not sure how Eller's would work in 3D, but there is probably a way. And the Binary Tree and Sidewinder algorithms seem like they ought to be possible to adap
46.
Generating random mazes with the Growing Tree algorithm (w/ Javascript demo)(weblog.jamisbuck.org)
86 points by jamis 16y ago|6 comments
47.
by jamis 16y ago
You're absolutely right. Both this one and Aldous-Broder both have a worst-case where the algorithm never terminates. As for whether the algorithm is "unacceptable", that depends on the application. For games? Yeah, this is probably far fro
48.
by jamis 16y ago
I don't believe Test::Unit does this intentionally; it's just a side-effect of the implementation (load all tests into an array, and iterate over the array).
49.
by jamis 16y ago
Aside from me simply wanting to be able to quickly run my tests locally, you mean? :) Mostly it's just an issue of configuring that so it works for all the programmers. Each would need their own remote, and each would need to be hooked into
50.
by jamis 16y ago
We do have a CI server, and as you said it works well for catching failing tests. However, it requires that you commit and push your changes in order to test them, which means you are effectively publishing untested changes to your entire t
51.
by jamis 16y ago
http://www.astrolog.org/labyrnth/algrithm.htm#perfect says that both the Aldous-Broder and Wilson's algorithms will generate "all possible Mazes of a given size with equal probability". But neither meets your criteria of "efficient", sinc
52.
by jamis 16y ago
Good point. I've removed the bit about O(log n), since aside from being misleading, it really wasn't even relevant to the point of the article.
53.
by jamis 16y ago
Yeah, the recursive backtracker is my favorite. Nicer results, and its very flexible. The other algorithms that I'm going to review are interesting for various reasons, and you can learn a lot about the structure and "essence" of graphs by
54.
by jamis 18y ago
You're right, of course, about the documentation being awful. I was actually working on fixing that at the end, but every time I'd spend a few evenings writing docs (which was a few more evenings where I didn't get to do what I wanted to do
55.
by jamis 18y ago
There was definitely an element of that, too. Most of the patches were reasonable changes: bug fixes, or minor feature additions that improved the usability for some large segment of the user base. There were a few that snuck in that I late
56.
by jamis 18y ago
If you're this traumatized by my decision, then honestly, I blame you (and people like you) for my burn out. Where were your contributions to the library, your documentation patches, your discussions of better ways to implement things? Have
57.
by jamis 18y ago
I don't believe that's effective, especially for projects like Net::SSH and Capistrano where the hacker-to-user ratio is so low. If someone wants to step forward and maintain Capistrano, they'll do so, and the community will organize around
58.
by jamis 18y ago
Why is it "grossly irresponsible" of me to take this action? Are lives going to be lost or injured as a result? Will the economy suffer? Will my leaving this project result in a health epidemic? I've never made any promises about the projec
59.
by jamis 18y ago
Actually, the two are orthogonal. You can monkey-patch an aggregation into a model as easily as you can monkey-patch anything else in. Also, modules aren't monkey-patching. :) http://en.wikipedia.org/wiki/Monkey_patch Lastly, the mod
60.
by jamis 18y ago
It is db-backed. It's just that the fields exist on the people table, instead of in their own table.

More ›