2 Tag [end-game] (wanted to create [yose], but lack the reputation)
| link
    Tweeted twitter.com/#!/StackBoardGames/status/131284403870633984
source | link

Do we have Go endgame tablebases, just like Chess?

I am a relative newcomer to Go and more interested in the programming aspects of designing a Go Engine.

Do Go engines use a systematic list of Endgame positions with known wins, the way chess engines do? And do professional-level Go players memorize a list of endgame positions as part of their training?

Some online digging turned up this Wikipedia article and computer science paper suggesting that Solving Go Endgames by computer is really hard problem, guaranteed to take up plenty of time. Perhaps that's the reason why Go endgame tablebases don't exist / aren't widely used?