On Tue, Jul 3, 2012 at 3:08 PM, Miheer Dewaskar wrote:
> On Tue, Jul 3, 2012 at 8:10 PM, Tim Chase
> wrote:
> I want it to be a generic Game solver.So the number of states depends
> on the game.
>
Keep in mind that it would probably be a generic game solver for games that
have simple board evalu
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 Dictionaries wont
help much right?
>>>
>>
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 Dictionaries wont
>>> help much right?
>>
>> Dicts are fast for lookup, not for searching.
>>
> What d
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 searching in the context of Dicts?
>
Miheer Dewaskar, 03.07.2012 13:11:
> 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
