for(int i = 0; i < path_to_walk.size(); i++)
{
  //if we found the spot in the path the player is currently on
   if(players_spot == i)
   {
       //find the diff between the next point and the players point
       int x_diff = player_spot.x - path_to_walk.x;
       <span class="cpp-keyword">int</span> y_diff = player_spot.y - path_to_walk.y; 

    <span class="cpp-comment">//make our velocity based on this</span>
       <span class="cpp-keyword">if</span>(x_diff &lt; <span class="cpp-number">0</span>)
          MOVE LEFT
       <span class="cpp-keyword">if</span>(x_diff &gt; <span class="cpp-number">0</span>)
           MOVE RIGHT
       SAME <span class="cpp-keyword">FOR</span> Y
    }
}

</pre></div><!–ENDSCRIPT–>

this worked, but &#111;nly if my path was a strait line. if the path was diagonal, it wouldnt move properly. he kind of just moved a little diagonal then stopped in his tracks.

also, i tried calculating the normalized vector (think thats what its called) for the players position and the next stop in the path, and then moving my player based &#111;n that, but that didnt work either. i was thinking this would be smoother and more elegant but i couldnt get it to work.

anyway, im hoping theres some cool way someone here could show me. thanks for any help!!

// move the unit some distancevoid CUnit::Move(){	localtimekey = *timekey * 10.0f;	patht += localtimekey;	if(patht > distance)																			// if we get to start moving towards a new target...	{		patht -= distance;																			// change patht to the dist traveled after it gets to the pos it is moving towards		TransformRO(direction * (localtimekey - patht));		//ro += direction * (localtimekey - patht);													// travel all of the way to the first way point		travelfrom = *path.begin();																	// we just got to this position		path.pop_front();																			// we just got here... remove it from the list of places to go		if(path.size() >= 1)																		// if we have another node to travel to...		{			RecalcMovement();																		// figure out which way we need to go now			TransformRO(direction * patht);			//ro += direction * (patht);															// use the rest of the time to go there		}		else																						// if we are out of places to go		{			traveling = false;																		// stop traveling		}	}	else	{		TransformRO(direction * localtimekey);		//ro += direction * localtimekey;	}}void CUnit::TransformRO(D3DXVECTOR2& trans){	velocity.x = trans.x;	velocity.z = trans.y;	terrain->GetHeightAtPoint(pos += trans, velocity.y);	tempfloat = velocity.y;	velocity.y -= lastheight;	lastheight = tempfloat;	ro += velocity;}void CUnit::RecalcMovement(){	distance = ((*path.begin()).x - travelfrom.x) * ((*path.begin()).x - travelfrom.x)			 + ((*path.begin()).y - travelfrom.y) * ((*path.begin()).y - travelfrom.y);	distance = sqrt(distance);																		// holds the distance between the next awypoint and the travelfrom point	D3DXVECTOR2 olddirection = direction;															// remember which direction we are facing	D3DXVec2Normalize(&direction, &((*path.begin()) - travelfrom));									// create the new direction vector, which is normalized and stored in direction		D3DXMATRIX mat;																					// holds the matrix used to rotate the unit		// sometime, this should be put into 1 line... less calculations	ro += -travelfrom;																				// move the unit back to 	float angle = acosf(D3DXVec2Dot(&direction, &olddirection));	D3DXMatrixRotationY(&mat, angle);	ro *= mat;	ro += travelfrom;}

Point player_position = get_player_point_in_map_coordinates();for(int i = 0; i < path_to_walk.size(); i++){    //if we found the tile the player is standing on in the path to walk    if(player_pos == path_to_walk.pos)   {       NOW HERE IS WHERE I NEED TO DO STUFF. player_pos is the players current (same as path_to_walk) and path_to_walk is the node i want to travel toward. how <span class="cpp-keyword">do</span> i calculate my velocity based on these <span class="cpp-number">2</span> things???<br>    }<br>}<br><br></pre></div><!–ENDSCRIPT–><br><br>i hope you understand what im trying to do and what i have already. its seems like something very easy, but i just cant figure it out. its kind of frustrating that something this simple is stopping my pathfinding from working. you would think calculating the shortest path via A* would be more complicated then actually moving the character around…<br><br>thanks a lot for anymore help!!<br><br><!–EDIT–><span class=editedby><!–/EDIT–>[Edited by - graveyard filla on August 3, 2004 9:01:28 PM]<!–EDIT–></span><!–/EDIT–>

Vector vecNormalize(Vector v){    return Vector(v.x / vecLength(v), v.y / vecLength(v));}Vector Vector::operator-(Vector v){    return Vecotor(x - v.x, y - v.y);}// inside each frame/game iteration:static float time, oldtime, timefactor;oldtime = time;time = TheTime();timefactor = time - oldtime;Vector movementvec = vecNormalize(currentposition - destination);playervec *= movementvec * timefactor * 0.5f;// the 0.5f is the number you fudge arround with or put into a menu somewhere.

//for each waypoint in the path to walk		for(int i = 0; i < path_to_walk.size(); i++)		{			//if we found what tile the player is standing on in this path to walk AND this isnt the last node			if(pp == path_to_walk.pos && i < (path_to_walk.size() - 1))			{