Your IP : 216.73.216.213
�
��f� c @ sE d Z d Z Gd d � d � Z d d � Z e d k rA e � n d S( u�
N queens problem.
The (well-known) problem is due to Niklaus Wirth.
This solution is inspired by Dijkstra (Structured Programming). It is
a classic recursive backtracking approach.
i c B st | Ee Z d Z e d d � Z d d � Z d d d � Z d d � Z d
d � Z d d
� Z d Z
d d � Z d S( u Queensc C s | | _ | j � d S( N( u nu reset( u selfu n( ( u6 /opt/alt/python33/lib64/python3.3/Tools/demo/queens.pyu __init__ s u Queens.__init__c C sf | j } d g | | _ d g | | _ d g d | d | _ d g d | d | _ d | _ d S( Ni i i ( u nu Noneu yu rowu upu downu nfound( u selfu n( ( u6 /opt/alt/python33/lib64/python3.3/Tools/demo/queens.pyu reset s u Queens.reseti c C s� x} t | j � D]l } | j | | � r | j | | � | d | j k rX | j � n | j | d � | j | | � q q Wd S( Ni ( u rangeu nu safeu placeu displayu solveu remove( u selfu xu y( ( u6 /opt/alt/python33/lib64/python3.3/Tools/demo/queens.pyu solve s
u Queens.solvec C s0 | j | o/ | j | | o/ | j | | S( N( u rowu upu down( u selfu xu y( ( u6 /opt/alt/python33/lib64/python3.3/Tools/demo/queens.pyu safe&