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

"de Bruijin sequence is a similar problem, but this problem has the additional constraint of being non-cyclical." [1]

[1] http://mathsci.wikia.com/wiki/Talk:The_Haruhi_Problem/@comme...



Additionally de bruijin sequences are about generating all possible n-length strings from a fixed k-character set (where you can repeat characters). In this problem we only want to generate k-length permutations of a k-character set.




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

Search: