All right, stand back; no pushing -- I know the demand for information about me is tremendous, but no one has to get hurt.
One of about 5 "native-born" San Franciscans currently living in San Francisco, I was born at Mt. Zion hospital on October 14, 1960. I am informed that at that time I was cute.
I live in the Inner Sunset with my beautiful wife Elaine. Our dear chinchilla baby Max (a.k.a. Pooples Fatty Puff the Magnificent, a.k.a. Senator Stuffington Fluffypants) has unfortunately passed on. :-(
You can see my chariot just after its bad-ass covert-op paint job in this picture. Don't mess with those bad boys.
I work at the UCSF Computer Graphics Lab as a programmer and system administrator. The principal programming project we're working on right now is the development of a molecular visualization package named Chimera.
My principal diversions, listed in approximately the order of the amount of time recently wasted on them, are:
The other aspect of Go that makes it significantly harder than chess is that Go positions are not amenable to simple analysis. Whereas in chess the count of pieces gives a strong indication of who is ahead, pieces are rarely removed in Go. Instead, "dead" groups are left in place since expending the moves to complete the capture would be a waste of time (unless the opponent first makes some attempt to save the group). Analysis of which groups are alive and dead is subtle and difficult and can't be done quickly as would be necessary for the "fast/dumb" approach of chess programming.
What's life without a challenge, though? So, I've written a Go program in C++ named gottaGo. It plays on the Computer Go Ladder against other people's programs. I administer the ladder. I'm currently working on upgrading gottaGo's code to use the STL which will make it easier to compile with modern C++ compilers.
Death, I suppose. Unless anyone has another suggestion.