This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.
Quote from: eri0o on Fri 17/08/2018 16:10:20
Hey, you forgot to show the function GetDistance.
int GetDistance(int x1, int y1, int x2, int y2)
{
float x1f = IntToFloat(x1);
float x2f = IntToFloat(x2);
float y1f = IntToFloat(y1);
float y2f = IntToFloat(y2);
float a = Maths.RaiseToPower((x2f - x1f), 2.0);
float b = Maths.RaiseToPower((y2f - y1f), 2.0);
float d = Maths.Sqrt(a + b);
int dist = FloatToInt(d);
return dist;
}// Movement uses a pretty basic algorithm.
// Manhattan distance to calculate the distance between the NPC and its target
function Person::Move(int toX, int toY)
{
int x1 = this.X;
int y1 = this.Y;
int x2 = toX;
int y2 = toY;
float tx = IntToFloat(x2 - x1);
float ty = IntToFloat(y2 - y1);
int dist = GetDistance(this.X, this.Y, x2, y2);
if (dist > 0)
{
tx = tx/IntToFloat(dist);
ty = ty/IntToFloat(dist);
this.X += FloatToInt(Maths.Ceil(tx));
this.Y += FloatToInt(Maths.Ceil(ty));
}
}/// Move People who are flagged as being on mission towards their destination
function MovePerson(int who)
{
// The ID of the mission an NPC is on (always 0 in this test)
int mission_id = People[who].MissionID;
// The ID of the target planet
int target_planet = Missions[mission_id].TargetPlanet;
// The current X/Y coords of the NPC
int pX = People[who].X;
int pY = People[who].Y;
// The X/Y coords of the target planet
int toX = planetarySystem[target_planet].X;
int toY = planetarySystem[target_planet].Y;
// If the NPC is on the target planet
if (pX == toX && pY == toY)
{
// Then is not on mission anymore
People[who].IsOnMission = false;
// Former target planet becomes new starting position
People[who].Where = Missions[mission_id].TargetPlanet;
}
else
{
// Move towards the target planet
People[who].Move(toX, toY);
}
}// This is the main function who controls the routine
function NextTurn(int turns)
{
for (int t = 0; t < turns; t++)
{
// If NPC (always 0 in this test) is flagged as being on mission
if (People[0].IsOnMission)
{
// Then move NPC (always 0 in this test)
MovePerson(0);
}
else
{
// Check that this code is actually being executed
Display("New Mission!");
int person = 0; // Always 0 in this test
// Select a random type of mission
int type = Random(MISSION_TYPES-1);
// Select the starting planet to be the same as the one the NPC is sitting on
int startPlanet = People[person].Where;
// Select a random target planet
int targetPlanet = Random(TOTAL_SYSTEMS-1);
// Repeat if start and target planets are the same
if ((targetPlanet == startPlanet))
{
do
{
targetPlanet = Random(TOTAL_SYSTEMS-1);
} while ((targetPlanet == startPlanet));
}
Missions[0].AssignedTo = 0; // The ID of the NPC to which this mission is assigned
Missions[0].ID = 0; // The ID of the mission
Missions[0].OriginPlanet = startPlanet;
Missions[0].TargetPlanet = targetPlanet;
Missions[0].Type = type;
People[0].MissionID = 0; // The same as Mission[0].ID
People[0].IsOnMission = true;
}
// Draw the pixels on the screen!
map.DrawPixelPeople();
}
}// This is the debug function I'm using to test the whole thing
function on_key_press(eKeyCode keycode)
{
if (keycode == eKey1)
{
for (int i = 0; i < 1500; i++)
{
NextTurn(1);
Wait(1); // I want to see it moving on the screen!
}
}
}
)
#define NCOLS 8
#define NROWS 8
int GetNodeAtRowCol(int row, int col)
{
return row*NCOLS+col;
}
int GetNodeAtYX(int y, int x)
{
return GetNodeAtRowCol((y - 8) / 8 , (x - 8) / 8);
}
// BigBang.ash
struct Node
{
int x, y;
int neighbours[8];
bool isFree;
int cost;
}
// Pathfinding.asc
int frontier[TOTAL_NODES];
int frontier_priority[TOTAL_NODES];
int came_from[TOTAL_NODES];
int cost_so_far[TOTAL_NODES];
int heuristic(int node_a, int node_b)
{
float n1x = IntToFloat(g_Nodes[node_a].x);
float n1y = IntToFloat(g_Nodes[node_a].y);
float n2x = IntToFloat(g_Nodes[node_b].x);
float n2y = IntToFloat(g_Nodes[node_b].y);
return FloatToInt(Maths.Ceil(Maths.Abs(n1x - n2x) + Maths.Abs(n1y - n2y)));
}
// Initialize all of the arrays for the search function
function InitializeArrays()
{
for (int i = 0; i < TOTAL_NODES; i++)
{
frontier[i] = -1;
came_from[i] = -1;
cost_so_far[i] = -1;
frontier_priority[i] = -1;
}
}
// Check if there is at least one valid element in the array
bool IsFrontierEmpty()
{
for (int i = 0; i < TOTAL_NODES; i++)
{
if (frontier[i] != -1)
{
return false;
}
}
return true;
}
// "Remove" the first valid element in the array and return its value
int Frontier_GetFirstNode()
{
int i, ret;
for (i = 0; i < TOTAL_NODES; i++)
{
// if something different than -1 is encountered
if (frontier[i] != -1)
{
// break the loop
break;
}
}
// store the value at the position
ret = frontier[i];
// "nullify" the element
frontier[i] = -1;
frontier_priority[i] = -1;
// return the stored value;
return ret;
}
// Insert
function Frontier_Insert(int node, int priority)
{
int cur;
// From the back of the array, copy each element to the following index, until desired position is reached
for (cur = TOTAL_NODES-2; cur >= 0; cur--)
{
frontier[cur+1] = frontier[cur];
frontier_priority[cur+1] = frontier_priority[cur];
}
// Fill the element at the desired position with the desired node's values
frontier[0] = node;
frontier_priority[0] = priority;
}
// Insert an element at the front of the array
function CameFrom_Insert(int node)
{
int cur;
// Copy each element to the slot next to them, until desired position is reached
for (cur = TOTAL_NODES-2; cur >= 0; cur--)
{
came_from[cur+1] = came_from[cur];
}
// Fill the element at the desired position with the desired node's values
came_from[0] = node;
}
// Return the first valid element from the back of the array
int CostSoFar_GetLastNode()
{
for (int j = TOTAL_NODES-1; j > 0; j--)
{
if (cost_so_far[j] != -1)
{
return cost_so_far[j];
}
}
}
// Check if the given node is already included in the array
bool CostSoFar_CheckNode(int node)
{
for (int i = 0; i < TOTAL_NODES; i++)
{
if (cost_so_far[i] == node)
{
return true;
}
}
return false;
}
// Foresee the cost of the next step in the search algorithm
int CostSoFar_NextStepCost(int node)
{
for (int i = 0; i < TOTAL_NODES; i++)
{
if (g_Nodes[i] == g_Nodes[node])
{
return g_Nodes[i].cost;
}
}
}
// Insert an element after the last valid one in the array
function CostSoFar_InsertToBack(int cost)
{
for (int i = TOTAL_NODES-1; i > 0; i--)
{
if (cost_so_far[i] != -1)
{
cost_so_far[i+1] = cost;
}
}
}
String a_star_search(int nStart, int nGoal)
{
// Initialize all arrays elements to -1
InitializeArrays();
// INIT start_location
int start_location = nStart;
int start_location_nbs[8];
for (int i = 0; i < 8; i++) start_location_nbs[i] = g_Nodes[nStart].neighbours[i];
// Add start_location to frontier
frontier[0] = nStart;
frontier_priority[0] = 0;
// Add start_location to frontier
came_from[0] = nStart;
// Add current cost of 0;
cost_so_far[0] = 0;
// As long as there is something different than -1 in frontier[]
while (!IsFrontierEmpty())
{
// Get the first element in frontier[]
int f_node = Frontier_GetFirstNode();
// INIT current_location
int current_location = f_node;
int current_location_nbs[8]; // neighbours
for (int i = 0; i < 8; i++)
{
current_location_nbs[i] = g_Nodes[f_node].neighbours[i];
}
// Stop searching once arrived to the destination
if (f_node == nGoal)
{
break;
}
// Scan the neighbours to see if they have been visited
for (int i = 0; i < 8; i++)
{
// Store the node
int neighbour_node = current_location_nbs[i];
// If the node is within the bounds
if (neighbour_node != -1)
{
// Calculate: last cost + the cost from the last location to the current one
int new_cost = CostSoFar_GetLastNode() + (CostSoFar_GetLastNode()+g_Nodes[neighbour_node].cost);
// Test the next iteration in advance to check whether it's valid or not
if (i+1 < 8 && current_location_nbs[i+1] != -1)
{
// If it's valid calculate the cost of the next location
int next_cost = CostSoFar_NextStepCost(current_location_nbs[i+1]);
// If we didn't visit this node yet OR if it is less expensive
if (!CostSoFar_CheckNode(current_location_nbs[i+1]) || new_cost < next_cost)
{
// Add the cost to the cost_so_far array
CostSoFar_InsertToBack(new_cost);
// Establish the priority
int priority = new_cost + heuristic(nGoal, current_location_nbs[i+1]);
// Insert the next neighbour at the top of the frontier array;
Frontier_Insert(current_location_nbs[i+1], new_cost); // *
// Insert the next neighbour at the top of the came_from array;
CameFrom_Insert(current_location_nbs[i+1]); // *
}
}
}
}
}
// Store the path into a string, separating values with comma
String s = "";
for (int i = TOTAL_NODES-1; i > 0; i--)
{
if (came_from[i] != -1)
{
String ss = String.Format("%d,", came_from[i]);
s = s.Append(ss);
}
}
return s;
}
export a_star_search;
Quote from: fernewelten on Sun 24/06/2018 14:25:12
If it's a stack in the classic sense, then you "push" something on top, and you "pop" something from the top. That means, at any point of time, the elements a[0], a[1] ... a[mx] for some mx are valid, the elements a[n+1], a[n+2] ... are invalid (free). So you don't need to keep track of "valid" for each element, but you manage an int mx as the fill level. It increments at each push and decrements at each pop.
for (int c = 0; c < 4; c++)
{
PathNode* pn = new PathNode;
pn.valid = true;
Push("frontier", pn);
}managed struct PathNode
{
bool valid;
};
PathNode* frontier[TOTAL_NODES];
PathNode* current;
function Pop(String array)
{
for (int n = 0; n < TOTAL_NODES; n++)
{
if (array == "frontier")
{
if (frontier[n].valid)
{
frontier[n].valid = false;
return; // also tried using break
}
}
}
}
function Push(String array, PathNode* to_add)
{
for (int n = TOTAL_NODES-1; n >= 0; n--)
{
if (array == "frontier")
{
if (frontier[n].valid)
{
frontier[n+1].valid = true;
frontier[n+1] = to_add;
}
else if (n == 0)
{
frontier[n].valid = true;
frontier[n] = to_add;
}
}
}
}
function game_start()
{
current = new PathNode;
current.valid = true;
for (int n = 0; n < TOTAL_NODES; n++)
{
frontier[n] = new PathNode;
frontier[n].valid = false;
}
if (Empty("frontier")) Display("Frontier is EMPTY");
else Display("Frontier is NOT EMPTY");
Push("frontier", current);
Push("frontier", current);
Push("frontier", current);
for (int n = 0; n < 5; n++)
{
Display("frontier\[%d]: %d", n, frontier[n].valid);
}
// Outputs:
// Frontier[0]: 1
// Frontier[1]: 1
// Frontier[2]: 1
// Frontier[3]: 0
// Frontier[4]: 0
Pop("frontier");
for (int n = 0; n < 5; n++)
{
Display("frontier\[%d]: %d", n, frontier[n].valid);
}
// Outputs:
// Frontier[0]: 0
// Frontier[1]: 0 -- SHOULD BE 1
// Frontier[2]: 0 -- SHOULD BE 1
// Frontier[3]: 0
// Frontier[4]: 0
}
function Pop(String array)
{
bool found = false;
for (int n = 0; n < TOTAL_NODES; n++)
{
if (!found)
{
if (array == "frontier")
{
if (frontier[n].valid)
{
frontier[n].valid = false;
found = true;
}
}
}
}
}function on_key_press(eKeyCode keycode)
{
if (keycode == eKeyU)
{
Pop("frontier");
for (int n = 0; n < 5; n++)
{
Display("frontier\[%d]: %d", n, frontier[n].valid);
}
}
}// Time.asc
int DateToRaw(int y, int m, int d)
{
return d + m * 100 + y * 10000; // Gives YYYYMMDD
}
Date* RawToDate(int rawDate)
{
Date* d = new Date;
d.Day = rawDate % 100;
d.Month = (rawDate / 100) % 100;
d.Year = rawDate / 10000;
return d;
}
int Date::RawDate()
{
return DateToRaw(this.Year, this.Month, this.Day);
}
bool Date::IsLeap()
{
return this.Year%4 == 0 && (this.Year%100 != 0 || this.Year%400 == 0);
}
function Date::Add(int days)
{
int newRawDate = this.RawDate() + days;
for (int i = this.RawDate(); i <= newRawDate; i++)
{
this.Day++;
if (this.Day > 28 && this.Month == 2)
{
if (!this.IsLeap())
{
this.Day = 1;
this.Month++;
}
else
{
if (this.Day > 29)
{
this.Day = 1;
this.Month++;
}
}
}
else if (this.Day > 30 && (this.Month == 11 || this.Month == 4 || this.Month == 6 || this.Month == 9))
{
this.Day = 1;
this.Month++;
}
else if (this.Day > 31 && (this.Month == 1 || this.Month == 3 || this.Month == 5 || this.Month == 7 || this.Month == 8 || this.Month == 10 || this.Month == 12))
{
this.Day = 1;
this.Month++;
if (this.Month == 13)
{
this.Month = 1;
this.Year++;
}
}
}
}// Missions.asc
// some other code
function CreateMission(int ID, MissionType type)
{
// some other code
Missions[ID].RawStartDate = CurrentDate.RawDate();
Date* start = RawToDate(Missions[ID].RawStartDate);
Date* due = start;
due.Add(30);
Missions[ID].RawDueDate = DateToRaw(due.Year, due.Month, due.Day);
// some other code
}
String MissionText(int ID)
{
String missionType;
// some other code
String p = planetarySystem[Missions[ID].TargetPlanet].name;
Date* start = RawToDate(Missions[ID].RawStartDate);
Date* due = RawToDate(Missions[ID].RawDueDate);
String s;
s = String.Format("%s is sent over to %s for %s, commissioned by The %s. Start: %.2d-%.2d-%.2d. Due: %.2d-%.2d-%.2d", People[Missions[ID].AssignedTo].name, p, missionType, Missions[ID].IssuingFaction, start.Day, start.Month, start.Year, due.Day, due.Month, due.Year);
return s;
}
for (int i = this.RawDate(); i < newRawDate; i++) // < instead of <=Quote from: selmiak on Thu 14/06/2018 18:11:55
then start at 3000-01-01 or whatever is closest to the ingame start date and add the numbers, or rather start at 0001-01-01 for easier calculating and calculate this internal and just add 3000 or so years every time you put out a date for the player to see.
Quote from: Snarky on Thu 14/06/2018 13:30:57
What do you need the int representation for, anyway?
I am not sure I can use it for all of the above purposes, though!
float GtoJ(int year, int month, int day)
{
float I = IntToFloat(year);
float J = IntToFloat(month);
float K = IntToFloat(day);
return K-32075.0+1461.0*(I+4800.0+(J-14.0)/12.0)/4.0+367.0*(J-2.0-(J-14.0)/12.0*12.0)/12.0-3.0*((I+4900.0+(J-14.0)/12.0)/100.0)/4.0;
}
Quote from: Snarky on Wed 13/06/2018 20:20:04
Without delving into the code (and I see that you've got the calculation from Stackoverflow, which would require further study), I'm guessing it's very likely to do with starting the month and day counts at 1 instead of 0. It messes with any calculations that use division or modulo.
Quote from: tzachs on Thu 14/06/2018 00:38:51The hacky solution works momentarily, but 3201 is not a leap year, while 3200 is, so you end up with this issue
Well, the hacky solution (without understanding the code, just based on the behavior you're describing) would be to move the "reduce one year" line to the end of the function, just before the return.
Note, though, that dealing with time is incredibly complex with like a billion of edge cases, so no matter what, test a lot.
Some reading material to appreciate the complexity:
https://infiniteundo.com/post/25326999628/falsehoods-programmers-believe-about-time
https://infiniteundo.com/post/25509354022/more-falsehoods-programmers-believe-about-time
:
// Time.ash
managed struct Date
{
int Hour;
int Minute;
int Second;
int Year;
int Month;
int Day;
import bool IsLeap();
import function Add(int days);
};
import int DateToRaw(int y, int m, int d); // converts years, months, days to days
import Date* RawToDate(int rawDate); // converts days to years, months, days
import function Clock(int speed); // speed = 40*x, where 40 is 1 second in game loops
import Date* StartDate; // set to 01-01-3200
import Date* CurrentDate; // updated by the clock// Time.asc
Date* StartDate;
Date* CurrentDate;
int tick; // Game loops
// I know it is kind of a duplicate but I was testing different solutions
bool leapyear(int year)
{
if (year % 4 != 0) return false;
if (year % 100 != 0) return true;
if (year % 400 != 0) return false;
return true;
//Alternative one-liner
/* return year%4 == 0 && (year%100 != 0 || year%400 == 0); */
}
// I know it is kind of a duplicate but I was testing different solutions
bool Date::IsLeap()
{
return leapyear(this.Year);
}
// This increases Date of x number of days, and keeps track of months and years
// It is not used in this example here but it works perfectly fine
function Date::Add(int days)
{
for (int i = 0; i < days; i++)
{
this.Day++;
if (this.Day > 28 && this.Month == 2)
{
if (!this.IsLeap())
{
this.Day = 1;
this.Month++;
}
else
{
if (this.Day > 29)
{
this.Day = 1;
this.Month++;
}
}
}
else if (this.Day > 30 && (this.Month == 11 || this.Month == 4 || this.Month == 6 || this.Month == 9))
{
this.Day = 1;
this.Month++;
}
else if (this.Day > 31 && (this.Month == 1 || this.Month == 3 || this.Month == 5 || this.Month == 7 || this.Month == 8 || this.Month == 10 || this.Month == 12))
{
this.Day = 1;
this.Month++;
if (this.Month == 13)
{
this.Month = 1;
this.Year++;
}
}
}
}
// Convert YYYY-MM-DD to days
// Found on stackoverflow, here https://stackoverflow.com/a/14224238
int DateToRaw(int y, int m, int d)
{
/* Rata Die day one is 0001-01-01 */
if (m < 3)
{
y--;
m += 12;
}
return 365*y + y/4 - y/100 + y/400 + (153*m - 457)/5 + d - 306;
}
// Convert days to YYYY-MM-DD
// includes code provided by vga256 and most of the code from the Date.Add() function
Date* RawToDate(int rawDate)
{
// Initialize a new Date object
Date* d = new Date;
d.Year = 1;
d.Month = 1;
d.Day = 1;
d.Second = 0;
d.Minute = 0;
d.Hour = 0;
int rawdays = rawDate;
int howmanyleapyears;
// To make it start at 3200 subtract 1
d.Year = rawdays / 365;
d.Year--; // *
// How many leap years from year 0001 to rawDate?
//
// PLEASE NOTE: I do this to keep the number of iterations low
// in order to prevent the loop from hanging
for (int i = 1; i < d.Year; i++)
{
if (leapyear(i)) howmanyleapyears++;
}
// If the current year is a leap year then calculate the
// remainder out of 366 days
if (d.IsLeap()) rawdays = (rawdays - howmanyleapyears) % 366;
// Otherwise calculate the remainder out of 365 days
else rawdays = (rawdays - howmanyleapyears) % 365;
// Same as the one in the Clock() function
for (int i = 0; i < rawdays; i++)
{
d.Day++;
if (d.Day > 28 && d.Month == 2)
{
if (!d.IsLeap())
{
d.Day = 1;
d.Month++;
}
else
{
if (d.Day > 29)
{
d.Day = 1;
d.Month++;
}
}
}
else if (d.Day > 30 && (d.Month == 11 || d.Month == 4 || d.Month == 6 || d.Month == 9))
{
d.Day = 1;
d.Month++;
}
else if (d.Day > 31 && (d.Month == 1 || d.Month == 3 || d.Month == 5 || d.Month == 7 || d.Month == 8 || d.Month == 10 || d.Month == 12))
{
d.Day = 1;
d.Month++;
if (d.Month == 13)
{
d.Month = 1;
d.Year++;
}
}
}
return d;
}
// Tick tock!
// The clock works perfectly fine
function Clock(int speed)
{
tick -= 1*speed;
if (tick <= 0)
{
CurrentDate.Second++;
if (CurrentDate.Second == 60)
{
CurrentDate.Second = 0;
CurrentDate.Minute++;
if (CurrentDate.Minute == 60)
{
CurrentDate.Minute = 0;
CurrentDate.Hour++;
if (CurrentDate.Hour == 24)
{
CurrentDate.Hour = 0;
CurrentDate.Day++;
if (CurrentDate.Day > 28 && CurrentDate.Month == 2)
{
if (!CurrentDate.IsLeap())
{
CurrentDate.Day = 1;
CurrentDate.Month++;
}
else
{
if (CurrentDate.Day > 29)
{
CurrentDate.Day = 1;
CurrentDate.Month++;
}
}
}
if (CurrentDate.Day > 30 && (CurrentDate.Month == 11 || CurrentDate.Month == 4 || CurrentDate.Month == 6 || CurrentDate.Month == 9))
{
CurrentDate.Day = 1;
CurrentDate.Month++;
}
else if (CurrentDate.Day > 31 && (CurrentDate.Month == 1 || CurrentDate.Month == 3 || CurrentDate.Month == 5 || CurrentDate.Month == 7 || CurrentDate.Month == 8 || CurrentDate.Month == 10 || CurrentDate.Month == 12))
{
CurrentDate.Day = 1;
CurrentDate.Month++;
if (CurrentDate.Month == 13)
{
CurrentDate.Month = 1;
CurrentDate.Year++;
}
}
}
}
}
tick = 40;
}
}
function repeatedly_execute()
{
// Runs and displays the clock on screen in a certain room
if (player.Room == 2)
{
Clock(1);
String s = String.Format("%.2d-%.2d-%.2d \\ %.2d:%.2d:%.2d", CurrentDate.Day, CurrentDate.Month, CurrentDate.Year, CurrentDate.Hour, CurrentDate.Minute, CurrentDate.Second);
lblCurrentTime.Text = s;
}
}
function game_start()
{
StartDate = new Date;
CurrentDate = new Date;
tick = 40;
StartDate.Year = 3200;
CurrentDate.Year = StartDate.Year;
StartDate.Month = 1;
CurrentDate.Month = StartDate.Month;
StartDate.Day = 31;
CurrentDate.Day = StartDate.Day;
StartDate.Second = 50;
CurrentDate.Second = StartDate.Second;
StartDate.Minute = 59;
CurrentDate.Minute = StartDate.Minute;
StartDate.Hour = 23;
CurrentDate.Hour = StartDate.Hour;
String s = String.Format("%.2d-%.2d-%.2d \\ %.2d:%.2d:%.2d", CurrentDate.Day, CurrentDate.Month, CurrentDate.Year, CurrentDate.Hour, CurrentDate.Minute, CurrentDate.Second);
lblCurrentTime.Text = s;
}
export CurrentDate;
export StartDate;String s;
int a = DateToRaw(CurrentDate.Year, CurrentDate.Month, CurrentDate.Day); // = 1168441
Date* b;
b = RawToDate(a);
s = String.Format("%.2d-%.2d-%.2d", b.Day, b.Month, b.Year);
return s;
 |  |