146 reputation
6
bio website
location Spain
age 25
visits member for 2 years, 10 months
seen Jan 22 at 20:39

Aug
16
comment Is there a programming language where 1/6 behaves the same as 1.0/6.0?
In Clojure 1/6 is actually 1/6 (fractional type) which, coerced to Double, is 1.66666...
Aug
16
comment Name of a class that creates a bunch of classes for a process
We all know that the hardest parts of computer science deal with cache invalidation and naming things Nope. That's actually easy. Cache is ALWAYS invalid and thing are named Foo and Bar ;)
Jun
6
awarded  Critic
Jun
5
comment Are Intel compilers really better than the Microsoft ones?
@RocketSurgeon open source has nothing to do with money.
Jun
4
comment The present and future of programming in local languages
Compiler output, error messages, documentation for tools and libraries. I've had some problems searching for localized output (from Visual Studio, IIRC) in the web. It's not always easy to translate the output to it's exact original. I can't agree more with that.
May
29
comment Finding an A* heuristic for a directed graph
@MSalters if you perform repeated searches you could annotate nodes as they're processed: for each found path, annotate each involved node with the actual distance unfolding the path. That's really a different problem since you still lack heuristic for a very large subset of the graph and know the exact distance (h(x) = h*(x)) for the small explored subset. I wouldn't call that a general heuristic. Even if you tried to statistically guess certain "zones" of the graph from surrounding data, you might be missing the actual minimal cost if not performing the search, and thus overestimating.
May
29
comment Finding an A* heuristic for a directed graph
@MSalters unfortunately if you lack information you can't derive an admissible heuristic. If there are just weights involved, you can only be sure that h(x) is less that the minimal distance. You can't even be sure if your goal is just two nodes away from the current node without actually performing the search, so any heuristic greater than minimal distance might be overstimating.
May
29
awarded  Commentator
May
29
comment Stuck due to “knowing too much”
@OldPro we all know that mantra. The point here is that TDD starts you working instead of thinking! Being test-driven doesn't mean you trust them.
May
29
comment Finding an A* heuristic for a directed graph
@MSalters I don't think that's what he intended to ask (although it's a great question, yup.) In the question he mentions streets so there' probably a way to figure a rough distance there. Also: he seems to be only concerned about one-way streets and the fact that d(x,y) is not constant. Posted my answer anyways. Would the asker care to clarify?
May
29
revised Finding an A* heuristic for a directed graph
added 320 characters in body
May
29
revised Finding an A* heuristic for a directed graph
added 848 characters in body
May
29
comment Finding an A* heuristic for a directed graph
@SnOrfus thank you too, fixed that aswell.
May
29
revised Finding an A* heuristic for a directed graph
added 15 characters in body
May
29
comment Finding an A* heuristic for a directed graph
@jk. you're completely right, thanks, I'm fixing it :)
May
28
awarded  Revival
May
28
awarded  Teacher
May
26
comment random generator not good enough?
@paulsmith apparently, he expected you to know a PRNG algorithm. If it's relevant to the job, it might be fit, although it still seems a bit far fetched as an interview question to me.
May
12
revised Finding an A* heuristic for a directed graph
added 273 characters in body
May
12
awarded  Editor