{"repository":{"description":"My solution to the n-queens problem using purely random mutation. The n-queens problem asks for an arrangement of n queens on an n x n chessboard such that no queen threatens any other queen. The program is written in Python and demonstrates the use of the argparse and itertools modules, the for-else statement, doctests, and list comprehensions.","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":112,"owner":"y0ssar1an","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"Python","created_at":"2013-04-02T23:10:09-07:00","pushed_at":"2013-04-02T23:18:01-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Ryan Boehning","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/y0ssar1an/nqueens/compare/bbd699bd89...51ff627e3a"}