Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Interesting idea, but how should this be determined? Would it be a "cost" per transistor and wirelength, and then the minimum clock cycle time would be the "worst case" path through the circuit?


Yes exactly. The 6.004 course at MIT already has software that does this sort of thing.


Thanks, it is a very cool idea. I wanted to make the game really simple and accessible, but there seem to be interest in optimization challenges like finding the smallest/cheapest/fastest possible solution.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: