Christoph Zwerschke wrote: > It should be easy to imagine use cases now. > > Take for example, a chess game. You are storing the pieces in a > 64-tuple, where every piece has an integer value corresponding to its > value in the game (white positive, black negative). You can approximate > the value of a position by building the sum(). You want to use the tuple > as a key for a dictionary of stored board constellations (e.g. an > opening dictionary), therefore you don't use a list. > > Now you want to find the field where the king is standing. Very easy > with the index() method. Or you want to find the number of pawns on the > board. Here you could use the count() method.
now, I'm no expert on data structures for chess games, but I find it hard to believe that any chess game implementer would use a data structure that re- quires linear searches for everything... </F> -- http://mail.python.org/mailman/listinfo/python-list
