No, because there would need to be many more graphics made to accomodate this rotation. Some entities already exist in all possible rotations, e.g. biters, players, cars, trains, ... The main problems are buildings. But, due to the HR graphics update, most entities should already have proper 3D mod...

I posted an error message for the mod Science Pack Dependencies stated below, however the issue seems to lie within your mod instead. ...snip... I'm pretty sure it's related to the bug mentioned at the end of last page which is already fixed by now. I couldn't get our mods to crash using 1.1.2 of N...

Same issue here, game wants libssl/libcrypto 1.0.0, I have 1.0.2 and 1.1 installed. Tricking the linker into using them doesn't work due to missing symbols.
Debian oldstable still has version 1.0.0, but that's, well... old

I recommend linking against a less ancient version of libssl and libcrypto

Jap2.0 wrote:Is there a Linux equivalent?

nice (or renice for a process that's already running)
But decreasing niceness (aka increasing the priority) usually requires root privileges.

+1 This bothered me for a long time before I got used to the current system but I would prefer this too. I'm thinking about something like this: http://i.imgur.com/2aaaf9M.png I think this is the best option. Except that the numbers on the left (consumption) aren't really necessary as they'll alway...

I chuckle at this whole discussion, because as a new player I find the entire tech tree (beginning at 3 layers down) to be so convoluted and confusing that probably only the most experienced players would even notice these issues. The UI for the tech tree needs work. Fear not! After adding all thos...

I just made a mod to add these dependencies. For a vanilla game it adds 66 new dependencies advanced-electronics (blue) to 2 progress techs: advanced-oil-processing, electric-energy-distribution-2 11 bonus only techs: braking-force-1, bullet-damage-5, bullet-speed-5, flamethrower-damage-3, grenade-d...

They use the A* algorithm which is normally algoritmically fast, but only gives approximate optimal results, since pathfinding is NP hard. And solving NP hard problems exact can take exponential time. Well, while A* being in NP is technically correct, A* is actually in P. The worst case, exploring ...

A* (and Dijkstra) are designed in a way that the very first solution found is the best. Correct; but this doesn't apply to the bidirectional variants of either algorithm. The last scanned node of the first complete path needn't be on a global optimal path at all. Instead, once those path trees have...

In the next example, the first solution found is not optimal, as the curves can be straightened, so extra steps of the algorithm is needed to find a better solution. I take it the heuristic function is not quite admissible (i.e., the cost-to-goal estimate can sometimes be slightly higher than the a...