notebook.community

Edit and run



In [ ]:

    
# SETUP

# Algorithm:

# states = all states known to contain one or more connected components.
#



In [1]:

    
# start with bucket or nd-array of gameboards

# build dictionaries of ints with int being in 1-to-1 correspondence with a gameboard

'hello'[:-3]









    Out[1]:





'he'



In [2]:

    
t  = '1234567890'
t[:-3], t[-3:]









    Out[2]:





('1234567', '890')



In [ ]: