Reputation
1,414
Top tag
Next privilege 2,000 Rep.
Edit questions and answers
Badges
3 12
Newest
 Yearling
Impact
~33k people reached

13h
comment How do I go from world coordinates (X/Y) to tile coordinates?
Simply invert the matrix - either by hand, or by invoking a Math library and printing the result.
Aug
27
comment What exactly are “tight controls”?
Typically a loose control means one with back lash - where a slight backwards movement (from the last direction of travel) of the control actually causes no action in the game. A tight control is one without any discernible backlash. A secondary desired characteristic in this regards is often non-linear behavior - where moving the control position twice as fast provides game behaviour more than twice as far.
Aug
27
revised A Star pathfinding on oblique map
added 389 characters in body
Aug
27
answered A Star pathfinding on oblique map
Aug
21
comment Pathfinding to find the route to nearest resource in 2D grid
@Felsir: Dijkstra terminates when you tell it to terminate; that is often the whole graph, but not if you set an alternate termination condition.
Aug
20
comment Pathfinding to find the route to nearest resource in 2D grid
You have missed a key concept - Dijkstra terminates when the goal condition is met. In your case, the goal condition is that a pellet has been reached. Run Dijkstra and terminate once a pellet has been reached. Check each clock pulse that no other agent has picked up the currently targeted pellet.
Aug
8
revised Rotate coordinates back after rotating game context (geometry)
added 16 characters in body
Aug
8
revised Rotate coordinates back after rotating game context (geometry)
added 884 characters in body
Aug
8
revised Rotate coordinates back after rotating game context (geometry)
added 9 characters in body
Aug
8
revised Rotate coordinates back after rotating game context (geometry)
added 9 characters in body
Aug
8
answered Rotate coordinates back after rotating game context (geometry)
Jul
26
comment Which of these two rotation methods are better
@DanielSenamAlorbi: Not to be offensive, but you could start by writing a question that doesn't scream "My knowledge of High School trigonometry and linear algebra is hopelessly muddled; please write my code for me." If you in fact do understand the basic linear algebra then demonstrate that in the question. If you don't, that's ok. just admit it and let us try to improve your understanding.
Jul
26
comment Which of these two rotation methods are better
And the reason for not using a Graphics Drawing library is ... ?
Jul
22
comment How to find the point on a hypotenuse divinging triangle into two right triangles?
See my answer for a calculation without any trigonometry or polar coordinates.
Jul
22
revised How to find the point on a hypotenuse divinging triangle into two right triangles?
added 53 characters in body
Jul
22
answered How to find the point on a hypotenuse divinging triangle into two right triangles?
Jul
22
answered Efficient parsing of text file to map
Jul
16
comment Pathfinding and collision avoidance on mobile
Your GPU has more than 50 processing units, so running A-star on the GPU for each monster should run juss as fast as on a regular CPU for ne agent.
Jul
16
comment How do I efficiently generate all valid configuration spaces of a Tetronimo in Tetris?
Possible duplicate of gamedev.stackexchange.com/questions/104002/…
Jul
16
comment Path finding in 2D grid for objects that can rotate and bigger than one tile (Tetris)
@redneksi: Eric Lippert provides an excellent 4-part introduction to A-star, using C# of course but applicable to any c-type language. Check the bottom of this blog archive: blogs.msdn.com/b/ericlippert/archive/2007/10.aspx