I want to make a combinatorial game solver in python.The algorithm is to
perform Depth First Search (DFS) on the states of the game.
For DFS I,would need to keep a record of the visited states.What is the
best data structure for it,keeping in mind that the number of states could
be large?
I was th
On Tue, Jul 3, 2012 at 4:53 PM, Stefan Behnel wrote:
>
> Miheer Dewaskar, 03.07.2012 13:11:
> > I am not sure,but if there are large number of states Dictionaries wont
> > help much right?
>
> Dicts are fast for lookup, not for searching.
>
What do you mean by search
On Tue, Jul 3, 2012 at 8:10 PM, Tim Chase wrote:
> On 07/03/12 08:39, Miheer Dewaskar wrote:
>> On Tue, Jul 3, 2012 at 4:53 PM, Stefan Behnel wrote:
>>>
>>> Miheer Dewaskar, 03.07.2012 13:11:
>>>> I am not sure,but if there are large number of states
