A flyable GST?

[Verdun1916]

Originally Posted by Igo kyu

Speaking as a just about programmer, that's a definite maybe.

Programming is a job. Like woodcarving, or sculpture. It's not easy. Anyone tells you it is easy, they are lying, that's simple.

Telling you where the limits are? That's not simple, that's not close to simple. With programming, the limits are a lot further out than with sculpture, but the extra range means extra effort, or extra creativity. Extra creativity costs.

The towers of hanoi tail recursive algorith, is pretty. If you don't grock that, I will tell you it's the best you can get. However, there is a non-recursive algorithm, for every number of discs. The recursive algorithm in fact reduces to the non-recursive algorithm for any particular number of disks. The code for the recursive algorithm is shorter for a number of disks greater than about three, and the recursive algorithm is general, it needs to deal with special cases where stack overflow is a problem which maybe about fifty or a hundred discs depending on the processor or maybe the operating system.

On the whole, don't assume that programming is like your work, it's very creative.

I'm not assuming anything! That's why I asked the questions that I did above. I want to know the reasons for why the stock game can't handle amphibious aircraft that historically could land on both water and land and how it can be solved or compromised to being able to have these birds and others like it in the stock game in the future. Your answer however did not answer my questions at all.

You only stated the obvious that programming is damn hard and that I already knew.