2009/10/29 terry mcintyre <terrymcint...@yahoo.com>: > That sounds to me like "a dumb human with a smart algorithm can beat a fast > computer with a dumb algorithm" -- which speaks more to Penrose's reluctance > to improve algorithms in his dumbed-down computer models than it does to any > quantum-physical effects. > > Stir in some theorem-proving ability - where a great deal of research was > accomplished decades ago - and a computer chess program can prove theorems > about chess positions, including "these bishops can never get past these > pawns."
It's still rather germane to the discussion though. With MC the algorithms have become dumber rather than smarter, so that influences the question whether the brute-force method will hit a wall or not. Take eyes, for example. MC programs have a very poor understanding of which groups are alive and which are dead. And this leads to problems which clearly cannot be solved by more computer-power. If I had time to work on MC programs I'd look for improvements in the status of groups during the playouts, trying to improve its notion of eyes. Mark _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
