Thanks! Good to hear others would be interested in something like that. It's one of those borderline "oh man that would be nice". > Python would let you iterat

Thanks! Good to hear others would be interested in something like that. It's one of those borderline "oh man that would be nice". > Python would let you iterate the algorithm quickly. It's far easier to optimize the big O notation of your autorouter than in C++, say. The hard part wouldn't be the routing algorithm itself. It's getting the algorithm and code to handle all of the corner cases. That's really what has kept me from it.. Getting all the correct data in and out of KiCad seems like a pain. > mostly because it would be easier to go back and forth in python rather than switching mental contexts between Nim and C and Python. If I were to tackle it, I'd do it in Nim since my overall productivity is as fast or faster than with Python. The Python layer would just be necessary to act as the glue layer to KiCad and `nimpy` looks great. It looks like `nimporter` builds binary wheel's too! That's awesome. Cython seems handy but involves more mental switching between Python-to-C types than Nim would (IMHO). Taking an example from the Cython docs and writing it in Nim with nimpy would be: proc randomNoise(number: int = 1): seq[float] {.exportpy.} = result = newSeq[float](number) for i in 0 .. number: result[i] = rand(1.0) Versus the original Cython: def random_noise(int number=1): cdef int i # allocate number * sizeof(double) bytes of memory cdef double *my_array = <double *> malloc( number * sizeof(double)) if not my_array: raise MemoryError() try: ran = random.normalvariate for i in range(number): my_array[i] = ran(0, 1) return [x for x in my_array[:number]] finally: free(my_array)