#Astar Circuit
1 messages · Page 1 of 1 (latest)
i can promise you that algorithm is either:
- Not A*
- Not Correct
- Takes hours to find a path
In order to do any form of pathfinding, you not only need to specify to the algorithm what the nodes are, but also what nodes are connected to each other
Checking if nodes are connected to each other takes a long time, and thus is usually baked beforehand
If you are doing it EVERY time, that algorithm is going to take insanely long
Keep in mind, my super optimized, super faster Disjktra's algorithm, from what I've seen is the fastest algorithm in RR, and it takes 2 seconds to calculate a vector field of 540 nodes (with a heat of 25%)
Bro just casually leaked his friends pathfinding circuit 💀
Me using a for to make it faster Litaly 
I know, thus my algorithm uses a custom for loop which lets me crank the speed up as much as I can whilst keeping reasonable CPU
Me when 2147483647 
Yes, the algorithm also uses that number in place of Infinity as ints do not support infinity
Yummy compiler = for from=-2147483648 to=2147483647
Thats possible after compiler thats the best part
It may just cause a massive lag spike
Massive lagspike won’t be that noticeable
People will think it’s just rec room breaking
so true
Because my oculus does that a lot 😁👍🏼
Does compiler make cpu completely gone though? Like what if I loop an execution back to itself and I execute it
The compiler wont allow that, it will probably mark it as an error
CPU is no longer capped by recroom, circuits will run 600x faster (meaning 600x more CPU than what we have now)
Hm
So what if i did this
For
From -2147483648
To 2147483647
Sequenced it to 64
Put it into another for with the same settings
And put it in a circuit that would usually take a lot of cpu
What would happen?