howeman

11 ms·

61.
by howeman 12y ago
People write that chess has ~ 10^42 board positions. If you read the paper about solving checkers (which you should because it's excellent), they evaluated about sqrt(N) positions, and the final solution took cuberoot(N) board position
62.
by howeman 12y ago
I'd be interested in seeing things you think are done correctly as well. We're working to build a statistics package in go as well (github.com/gonum/stat). It's good that people are taking a fresh look. Our capabili
63.
by howeman 12y ago
Go does have a goto statement, and one of its good uses is to transfer to an error handling block (from what I've seen). There are also type annotations (tags), though I don't know how/if they relate to sql
64.
by howeman 12y ago
Actually, the c compiler just got deleted. https://groups.google.com/forum/#!topic/golang-codereviews/A...
65.
by howeman 12y ago
They also found (and fixed) some bugs and the code will be more robust to future implementation changes.
66.
by howeman 12y ago
The Navier-Stokes have no problem with stall. The problem is that the Navier-Stokes equations are hard to solve (to use them predictively). The Euler equations do not account for turbulence at all. The Euler equations are good at modeling p
67.
by howeman 12y ago
Go sort of does this, though on longer timescales. Developers are at "tip". Actual releases are every 6 months, and before the release there is always at least one release candidate, and sometimes an actual beta.
68.
by howeman 12y ago
Nice to have you be less internal!
69.
by howeman 12y ago
December 1st. 1.3 slipped by two weeks but 1.2 was on the money.
70.
by howeman 12y ago
Just as a clarification, the proposals are to add multi-dimensional slices (dynamically sized arrays). This statement is splitting hairs, but a Matrix is a container for numeric types that can do things like multiply and have a cholesky dec
71.
by howeman 12y ago
Really? They're all that equal? I haven't played much, but the little bit I have Austria always gets crushed.
72.
by howeman 12y ago
Not to mention there's 2/3rds of a go BLAS implementation (benchmarks https://groups.google.com/forum/#!msg/gonum-dev/Cqa41tbUUCw/... ). Level 3 routines are much harder to make efficient (peopl
73.
by howeman 12y ago
As of at least a year ago, their are bindings for the BLAS library of your choice (github.com/gonum/blas), which are used in many parts of the matrix package (github.com/gonum/matrix/mat64). As of a week ago, there
74.
by howeman 12y ago
Besides operator overloading, why can't Go do Numpy?
75.
by howeman 12y ago
Combining a couple ideas, here's a Go solution http://play.golang.org/p/XnPglbkLW4
76.
by howeman 12y ago
At some point they fill in their territory and lose all of their stones. Eventually they will have no where to play.
77.
by howeman 12y ago
It's complicated. Most rulesets (AGA, New Zealand, I believe chinese) say "resume the game". The Japanese ruleset is a lot more complicated. I still don't see your argument. Humans and humans are capable of agreeing on a
78.
by howeman 12y ago
I don't know what you mean by "the game is actually finished". AGA Rules: 9) Ending the Game: Two consecutive passes signal the end of the game. New Zealand rules: The game is finished when both players agree that there are n
79.
by howeman 12y ago
Sure, but that number is a lower bound, not an upper bound.
80.
by howeman 12y ago
I do. I can send you an e-mail confirmation if you'd like.
81.
by howeman 12y ago
It's been fun to watch the E-MAIL --> E-Mail --> E-mail --> e-mail --> email transition
82.
by howeman 12y ago
I am one of the developers, and at the moment I wouldn't use it for critical stuff. We would like it to be good (not just functional) and that takes time. We are not in "1.0" stage yet, and we make backward incompatible chang
83.
by howeman 12y ago
I think it would be nice if there was one, but I'm not going to write it. I would guess that's the problem.
84.
by howeman 13y ago
Comparing floats is sometimes useful. For example, if you are testing that you have copied a data structure correctly.
85.
by howeman 13y ago
You might also look at biogo for inspiration https://code.google.com/p/biogo/
86.
by howeman 13y ago
Packages aren't enough of a namespace differentiator for you?
87.
by howeman 13y ago
I think he was suggesting that you wrote the compiler to use only the parts of C that could be converted to go, not that C was written to be convertible to go.
88.
by howeman 13y ago
They aren't writing a general tool from C to Go. They are writing a specific tool to convert the compiler from C to Go. They will then make major modifications, but it's much easier to do that from working Go code than from scratc
89.
by howeman 13y ago
On the stability, the point is that if you'd like to use it you should fork it.
90.
by howeman 13y ago
If anyone is interested, I have a working neural net implementation https://github.com/btracey/nnet . I don't make any stability promises (especially on the training routines, that's a mess at the moment), bu

More ›