meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 2 years, 3 months |
| seen | 12 hours ago | |
| stats | profile views | 60 |
Worked as a computer game designer and developer for five years. Most proud of Torquing!
Now working in other fields of software, but still aim to participate in the Java4k game contest each year.
|
May 14 |
comment |
How much is java used in 2d/3d indie games? (before/after Minecraft) @JCM, it will still be using Java on the back end, and I wouldn't be surprised if the JS/WebGL front end is produced by source-to-source translation from Java (à la GWT, but given Jagex's NIH culture probably not actually GWT). |
|
May 7 |
comment |
Is it legal to reuse a 3D model as long as it has a new texture? That's still technically a derived work. |
|
May 3 |
comment |
What is the rationale behind this method of computing the w-component from MD5 mesh files? @pcapp, you could add logging to that branch, but I think it's less about mitigating bad input and more about not getting NaN when rounding causes t to be something like -1E-9. |
|
Apr 17 |
awarded | Organizer |
|
Apr 17 |
revised |
Generate slot combinations edited tags |
|
Apr 16 |
comment |
Minimax for Bomberman Yes, you're missing a few things, but you won't thank me for pointing them out because they make it worse. There aren't 5 basic actions. Some squares have 5 "moves" (4 directions and stay still); others have 3 (because they're blocked in two directions); on average it's 4. But you can drop a bomb while running, so on average the branching factor is 8. And someone with a high-speed powerup can fit in more moves, effectively pushing up their branching factor. |
|
Apr 1 |
comment |
How to simulate early politics? I would start by examining what happens when an Allosaurus enters contemporary politics: irregularwebcomic.net/… |
|
Mar 27 |
answered | Javascript board game: looking for optimization |
|
Feb 14 |
answered | Determining Poker Hands |
|
Feb 5 |
comment |
How do I detect the intersection of a curve with itself? Ok, I'll take a step back. Have you written the code to draw your line? If so, could you edit the question to add it? |
|
Feb 4 |
comment |
How do I detect the intersection of a curve with itself? @dennmat, it's not the only viable solution. As you observe, a list of points is another; I could add that some curves can be drawn by Bresenham's algorithm or variants, or by marching squares. |
|
Feb 4 |
comment |
How do I detect the intersection of a curve with itself? Paul Manta's question still isn't really answered. Are the lines simple chains of straight line segments, or are you doing something more complicated? If they're simple chains of straight line segments, do you know how to check whether two straight line segments intersect? |
|
Jan 29 |
awarded | Yearling |
|
Jan 24 |
comment |
Derive a algorithm to match best position Looks like a trivial generalisation of the knapsack problem |
|
Dec 20 |
comment |
“Super meatboy”-ish replay To save on the position you can also delta-encode, although that ends up being subsumed under the key-frame approach. |
|
Dec 18 |
comment |
Should pathfinder in A* hold closedSet and openedSet or each object should hold its sets? Why a static function or a method on a graph? Surely it should be an implementation of a path-finding interface which can be used as a strategy? |
|
Dec 15 |
awarded | Good Answer |
|
Dec 13 |
comment |
How can I use iteration to lead targets? If your quadratic doesn't have any roots then surely the best you can do is simple to take the extremum, which will be as close as possible to an actual hit? So you still don't gain anything by using an iterative approximation. |
|
Dec 1 |
answered | How to prevent a hacked-server from spoofing a master server? |
|
Nov 24 |
answered | Routes on a sphere surface - Find geodesic? |
