Reply to thread

Message

<blockquote data-quote="Roper" data-source="post: 11696" data-attributes="member: 235">Use this pathfinder in uberEmulator, i'll give you the code but you may have to do some of your own tweaks to it.[CODE]using System;namespace Chop.Game.Rooms{&nbsp; &nbsp; // CREDITS TO CECER1 FOR MAKING THIS!&nbsp; &nbsp; public class IHIPathfinder&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; private byte[,] CollisionMap;&nbsp; &nbsp; &nbsp; &nbsp; private float[,] Height;&nbsp; &nbsp; &nbsp; &nbsp; public IHIPathfinder()&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; public void ApplyCollisionMap(byte[,] Map, float[,] Height)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (CollisionMap != null)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; lock (CollisionMap)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; CollisionMap = Map;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; this.Height = Height;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; CollisionMap = Map;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; this.Height = Height;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; public byte[] Path(byte StartX, byte StartY, byte EndX, byte EndY)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; IHIPathfinderValues Values;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; lock (CollisionMap)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values = new IHIPathfinderValues(CollisionMap, Height);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (EndX &gt;= CollisionMap.GetLength(0) || EndY &gt;= CollisionMap.GetLength(1) || CollisionMap[EndX, EndY] == 0 || (StartX == EndX &amp;&amp; StartY == EndY))&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return new byte[0];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; #region Init&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (StartX &gt; CollisionMap.GetUpperBound(0) || StartY &gt; CollisionMap.GetUpperBound(1))&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return new byte[0];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.LastID++;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.Count++;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.BinaryHeap[Values.Count] = Values.LastID;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.X[Values.LastID] = StartX;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.Y[Values.LastID] = StartY;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.H[Values.LastID] = (ushort)GetH(StartX, StartY, EndX, EndY);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.Parent[Values.LastID] = 0;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.G[Values.LastID] = 0;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.F[Values.LastID] = (ushort)(Values.G[Values.LastID] + Values.H[Values.LastID]);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; #endregion&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; while (Values.Count != 0)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.Location = Values.BinaryHeap[1];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (Values.X[Values.Location] == EndX &amp;&amp; Values.Y[Values.Location] == EndY)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; break;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Move(Values);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Add(-1, -1, EndX, EndY, Values);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Add(-1, 1, EndX, EndY, Values);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Add(1, -1, EndX, EndY, Values);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Add(1, 1, EndX, EndY, Values);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Add(-1, 0, EndX, EndY, Values);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Add(0, -1, EndX, EndY, Values);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Add(1, 0, EndX, EndY, Values);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Add(0, 1, EndX, EndY, Values);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (Values.Count == 0)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return new byte[0];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; while (Values.X[Values.Parent[Values.Location]] != StartX || Values.Y[Values.Parent[Values.Location]] != StartY)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.Location = Values.Parent[Values.Location];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return new byte[] { Values.X[Values.Location], Values.Y[Values.Location] };&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; int GetH(int X, int Y, int EndX, int EndY)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return (Math.Abs(X + EndX) + Math.Abs(Y + EndY));&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; private void Add(sbyte iX, sbyte iY, byte EndX, byte EndY, IHIPathfinderValues Values)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; byte X = (byte)(Values.X[Values.Location] + iX);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; byte Y = (byte)(Values.Y[Values.Location] + iY);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; ushort Parent = Values.Location;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (X &gt; CollisionMap.GetUpperBound(0) || Y &gt; CollisionMap.GetUpperBound(1))&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (Values.Tiles[X, Y] == 2)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if ((CollisionMap[X, Y] == 0 || (CollisionMap[X, Y] == 2 &amp;&amp; (X != EndX || Y != EndY))))&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; float Z = Values.Z[X, Y];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; float pZ = Values.Z[Values.X[Parent], Values.Y[Parent]];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (Z &gt; pZ + 1.2 || Z &lt; pZ - 3.0) // TODO: Max/Min jump height from database&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (Parent &gt; 0)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (Values.X[Parent] != X &amp;&amp; Values.Y[Parent] != Y)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (CollisionMap[X, Values.Y[Parent]] == 0 || CollisionMap[X, Values.Y[Parent]] == 2)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (CollisionMap[Values.X[Parent], Y] == 0 || CollisionMap[Values.X[Parent], Y] == 2)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (Values.Tiles[X, Y] == 1)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; ushort i = 1;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (; i &lt;= Values.Count; i++)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (Values.X[i] == X &amp;&amp; Values.Y[i] == Y)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; break;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (Values.X[i] == EndX || Values.Y[i] == EndY)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (10 + Values.G[Parent] &lt; Values.G[i])&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.Parent[i] = Parent;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (14 + Values.G[Parent] &lt; Values.G[i])&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.Parent[i] = Parent;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.LastID++;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.Count++;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.BinaryHeap[Values.Count] = Values.LastID;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.X[Values.LastID] = X;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.Y[Values.LastID] = Y;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.H[Values.LastID] = (ushort)GetH(X, Y, EndX, EndY);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.Parent[Values.LastID] = Parent;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (X == Values.X[Parent] || Y == Values.Y[Parent])&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.G[Values.LastID] = (ushort)(10 + Values.G[Parent]);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.G[Values.LastID] = (ushort)(14 + Values.G[Parent]);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.F[Values.LastID] = (ushort)(Values.G[Values.LastID] + Values.H[Values.LastID]);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; ushort Temp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (ushort C = Values.Count; C != 1; C /= 2)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (Values.F[Values.BinaryHeap[C]] &lt;= Values.F[Values.BinaryHeap[C / 2]])&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Temp = Values.BinaryHeap[C / 2];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.BinaryHeap[C / 2] = Values.BinaryHeap[C];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.BinaryHeap[C] = Temp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; break;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.Tiles[X, Y] = 1;&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; private static void Move(IHIPathfinderValues Values)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.Tiles[Values.X[Values.BinaryHeap[1]], Values.Y[Values.BinaryHeap[1]]] = 2;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.BinaryHeap[1] = Values.BinaryHeap[Values.Count];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.Count--;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; ushort Location = 1;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; ushort High;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; while (true)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; High = Location;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (2 * High + 1 &lt;= Values.Count)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (Values.F[Values.BinaryHeap[High]] &gt;= Values.F[Values.BinaryHeap[2 * High]]) Location = (ushort)(2 * High);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (Values.F[Values.BinaryHeap[Location]] &gt;= Values.F[Values.BinaryHeap[2 * High + 1]]) Location = (ushort)(2 * High + 1);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if (2 * High &lt;= Values.Count)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (Values.F[Values.BinaryHeap[High]] &gt;= Values.F[Values.BinaryHeap[2 * High]]) Location = (ushort)(2 * High);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (High != Location)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; ushort Temp = Values.BinaryHeap[High];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.BinaryHeap[High] = Values.BinaryHeap[Location];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Values.BinaryHeap[Location] = Temp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; break;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; }&nbsp; &nbsp; public class IHIPathfinderValues&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; public byte[,] Tiles;&nbsp; &nbsp; &nbsp; &nbsp; public float[,] Z;&nbsp; &nbsp; &nbsp; &nbsp; public byte[] X;&nbsp; &nbsp; &nbsp; &nbsp; public byte[] Y;&nbsp; &nbsp; &nbsp; &nbsp; public ushort[] H;&nbsp; &nbsp; &nbsp; &nbsp; public ushort[] G;&nbsp; &nbsp; &nbsp; &nbsp; public ushort[] F;&nbsp; &nbsp; &nbsp; &nbsp; public ushort Count;&nbsp; &nbsp; &nbsp; &nbsp; public ushort LastID;&nbsp; &nbsp; &nbsp; &nbsp; public ushort[] BinaryHeap;&nbsp; &nbsp; &nbsp; &nbsp; public ushort[] Parent;&nbsp; &nbsp; &nbsp; &nbsp; public ushort Location;&nbsp; &nbsp; &nbsp; &nbsp; public IHIPathfinderValues(byte[,] CollisionMap, float[,] Height)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Tiles = new byte[CollisionMap.GetLength(0), CollisionMap.GetLength(1)];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; X = new byte[Tiles.Length];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Y = new byte[X.Length];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Z = Height;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; H = new ushort[X.Length];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; G = new ushort[X.Length];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; F = new ushort[X.Length];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Count = 0;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; LastID = 0;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; BinaryHeap = new ushort[X.Length];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Parent = new ushort[X.Length];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Location = 0;&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; }}[/CODE]</blockquote>

[QUOTE="Roper, post: 11696, member: 235"] Use this pathfinder in uberEmulator, i'll give you the code but you may have to do some of your own tweaks to it. [CODE] using System; namespace Chop.Game.Rooms { // CREDITS TO CECER1 FOR MAKING THIS! public class IHIPathfinder { private byte[,] CollisionMap; private float[,] Height; public IHIPathfinder() { } public void ApplyCollisionMap(byte[,] Map, float[,] Height) { if (CollisionMap != null) lock (CollisionMap) { CollisionMap = Map; this.Height = Height; } else { CollisionMap = Map; this.Height = Height; } } public byte[] Path(byte StartX, byte StartY, byte EndX, byte EndY) { IHIPathfinderValues Values; lock (CollisionMap) { Values = new IHIPathfinderValues(CollisionMap, Height); if (EndX >= CollisionMap.GetLength(0) || EndY >= CollisionMap.GetLength(1) || CollisionMap[EndX, EndY] == 0 || (StartX == EndX && StartY == EndY)) return new byte[0]; #region Init if (StartX > CollisionMap.GetUpperBound(0) || StartY > CollisionMap.GetUpperBound(1)) return new byte[0]; Values.LastID++; Values.Count++; Values.BinaryHeap[Values.Count] = Values.LastID; Values.X[Values.LastID] = StartX; Values.Y[Values.LastID] = StartY; Values.H[Values.LastID] = (ushort)GetH(StartX, StartY, EndX, EndY); Values.Parent[Values.LastID] = 0; Values.G[Values.LastID] = 0; Values.F[Values.LastID] = (ushort)(Values.G[Values.LastID] + Values.H[Values.LastID]); #endregion while (Values.Count != 0) { Values.Location = Values.BinaryHeap[1]; if (Values.X[Values.Location] == EndX && Values.Y[Values.Location] == EndY) break; Move(Values); Add(-1, -1, EndX, EndY, Values); Add(-1, 1, EndX, EndY, Values); Add(1, -1, EndX, EndY, Values); Add(1, 1, EndX, EndY, Values); Add(-1, 0, EndX, EndY, Values); Add(0, -1, EndX, EndY, Values); Add(1, 0, EndX, EndY, Values); Add(0, 1, EndX, EndY, Values); } } if (Values.Count == 0) return new byte[0]; while (Values.X[Values.Parent[Values.Location]] != StartX || Values.Y[Values.Parent[Values.Location]] != StartY) { Values.Location = Values.Parent[Values.Location]; } return new byte[] { Values.X[Values.Location], Values.Y[Values.Location] }; } int GetH(int X, int Y, int EndX, int EndY) { return (Math.Abs(X + EndX) + Math.Abs(Y + EndY)); } private void Add(sbyte iX, sbyte iY, byte EndX, byte EndY, IHIPathfinderValues Values) { byte X = (byte)(Values.X[Values.Location] + iX); byte Y = (byte)(Values.Y[Values.Location] + iY); ushort Parent = Values.Location; if (X > CollisionMap.GetUpperBound(0) || Y > CollisionMap.GetUpperBound(1)) return; if (Values.Tiles[X, Y] == 2) return; if ((CollisionMap[X, Y] == 0 || (CollisionMap[X, Y] == 2 && (X != EndX || Y != EndY)))) return; float Z = Values.Z[X, Y]; float pZ = Values.Z[Values.X[Parent], Values.Y[Parent]]; if (Z > pZ + 1.2 || Z < pZ - 3.0) // TODO: Max/Min jump height from database return; if (Parent > 0) { if (Values.X[Parent] != X && Values.Y[Parent] != Y) { if (CollisionMap[X, Values.Y[Parent]] == 0 || CollisionMap[X, Values.Y[Parent]] == 2) return; if (CollisionMap[Values.X[Parent], Y] == 0 || CollisionMap[Values.X[Parent], Y] == 2) return; } } if (Values.Tiles[X, Y] == 1) { ushort i = 1; for (; i <= Values.Count; i++) { if (Values.X[i] == X && Values.Y[i] == Y) break; } if (Values.X[i] == EndX || Values.Y[i] == EndY) { if (10 + Values.G[Parent] < Values.G[i]) Values.Parent[i] = Parent; } else if (14 + Values.G[Parent] < Values.G[i]) Values.Parent[i] = Parent; return; } Values.LastID++; Values.Count++; Values.BinaryHeap[Values.Count] = Values.LastID; Values.X[Values.LastID] = X; Values.Y[Values.LastID] = Y; Values.H[Values.LastID] = (ushort)GetH(X, Y, EndX, EndY); Values.Parent[Values.LastID] = Parent; if (X == Values.X[Parent] || Y == Values.Y[Parent]) Values.G[Values.LastID] = (ushort)(10 + Values.G[Parent]); else Values.G[Values.LastID] = (ushort)(14 + Values.G[Parent]); Values.F[Values.LastID] = (ushort)(Values.G[Values.LastID] + Values.H[Values.LastID]); ushort Temp; for (ushort C = Values.Count; C != 1; C /= 2) { if (Values.F[Values.BinaryHeap[C]] <= Values.F[Values.BinaryHeap[C / 2]]) { Temp = Values.BinaryHeap[C / 2]; Values.BinaryHeap[C / 2] = Values.BinaryHeap[C]; Values.BinaryHeap[C] = Temp; } else break; } Values.Tiles[X, Y] = 1; } private static void Move(IHIPathfinderValues Values) { Values.Tiles[Values.X[Values.BinaryHeap[1]], Values.Y[Values.BinaryHeap[1]]] = 2; Values.BinaryHeap[1] = Values.BinaryHeap[Values.Count]; Values.Count--; ushort Location = 1; ushort High; while (true) { High = Location; if (2 * High + 1 <= Values.Count) { if (Values.F[Values.BinaryHeap[High]] >= Values.F[Values.BinaryHeap[2 * High]]) Location = (ushort)(2 * High); if (Values.F[Values.BinaryHeap[Location]] >= Values.F[Values.BinaryHeap[2 * High + 1]]) Location = (ushort)(2 * High + 1); } else if (2 * High <= Values.Count) { if (Values.F[Values.BinaryHeap[High]] >= Values.F[Values.BinaryHeap[2 * High]]) Location = (ushort)(2 * High); } if (High != Location) { ushort Temp = Values.BinaryHeap[High]; Values.BinaryHeap[High] = Values.BinaryHeap[Location]; Values.BinaryHeap[Location] = Temp; } else break; } } } public class IHIPathfinderValues { public byte[,] Tiles; public float[,] Z; public byte[] X; public byte[] Y; public ushort[] H; public ushort[] G; public ushort[] F; public ushort Count; public ushort LastID; public ushort[] BinaryHeap; public ushort[] Parent; public ushort Location; public IHIPathfinderValues(byte[,] CollisionMap, float[,] Height) { Tiles = new byte[CollisionMap.GetLength(0), CollisionMap.GetLength(1)]; X = new byte[Tiles.Length]; Y = new byte[X.Length]; Z = Height; H = new ushort[X.Length]; G = new ushort[X.Length]; F = new ushort[X.Length]; Count = 0; LastID = 0; BinaryHeap = new ushort[X.Length]; Parent = new ushort[X.Length]; Location = 0; } } } [/CODE] [/QUOTE]

Verification

Reply to thread

Connect with us

Newest members