Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>Here's my A-star path finder, it works and you're free to use it for learning and comparing your solution against it, rip me off if you like. But there are dependencies that are missing from this code and I'm using fixed-point arithmetic. This won't build without some changes. This code is relatively high level and should be easy enough to reverse engineer.</p> <pre><code>public class AgentPathfinder { class SolutionComparer : IComparer&lt;Solution&gt; { public int Compare(Solution x, Solution y) { return x.Cost.CompareTo(y.Cost); } } class Solution { public List&lt;FixedVector&gt; Path { get; private set; } public FixedVector LastPosition { get { return Path[Path.Count - 1]; } } public Fixed32 Heuristic { get; set; } public Fixed32 Cost { get; set; } public Solution(FixedVector position, Fixed32 heuristic) { Path = new List&lt;FixedVector&gt;(2) { position }; Heuristic = heuristic; Cost = Path.Count + heuristic; } public Solution(FixedVector position , Fixed32 heuristic , List&lt;FixedVector&gt; path) { Path = new List&lt;FixedVector&gt;(path) { position }; Heuristic = heuristic; Cost = Path.Count + heuristic; } } // TODO: replace with pathable terrain data public Map Map { get; set; } public FixedVector Position { get; set; } public FixedVector Destination { get; set; } public List&lt;FixedVector&gt; Path { get; set; } public void Compute() { var visited = new bool[(int)Map.Size.Width, (int)Map.Size.Height]; var pq = new PriorityQueue&lt;Solution&gt;(new SolutionComparer()); var bestFit = new Solution(new FixedVector((int)(Position.X + 0.5) , (int)(Position.Y + 0.5)) , (Destination - Position).Length ); pq.Enqueue(bestFit); while (pq.Count &gt; 0) { var path = pq.Dequeue(); // optimal, thus far if (path.Heuristic &lt; bestFit.Heuristic) // best approximation? { // if we starve all other paths we // fallback to this, which should be the best // approximation for reaching the goal bestFit = path; } for (int i = 0; i &lt; FixedVector.Adjacent8.Length; i++) { var u = path.LastPosition + FixedVector.Adjacent8[i]; if (Map.Size.Contains(u)) { if (Map.IsPathable(u)) { if (!visited[(int)u.X, (int)u.Y]) { // heuristic (straight-line distance to the goal) var h = (Destination - u).Length; var solution = new Solution(u, h, path.Path); if (h &lt; 1) { Path = solution.Path; return; // OK, done } else { // keep looking pq.Enqueue(solution); } visited[(int)u.X, (int)u.Y] = true; } } } } } Path = bestFit.Path; } } </code></pre>
    singulars
    1. This table or related slice is empty.
    1. POC# AStar problems, won't do it correctly
      singulars
      1. PTQuestion
    1. PTAnswer
    1. This table or related slice is empty.
    1. USJohn Leidegren
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. This table or related slice is empty.
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload