i don't even necessarily think that it won't be around for a long time.
look at java. it'll be here for a long time to come. and it was very hot for a few years. but now its the cool, safe, standard language CS people pick up. and ruby, for rails, is the new hot language (which was virtually unknown outside of japan for many years until rails hit).
how long till rails cools down and something else picks up steam? how long until the answer to the question "i'm new, what language should i learn?" is something other than "ruby"?
on the flip side of that coin, COBOL programmers get paid a pretty penny nowadays because there are so few of them, but so many COBOL programs are still alive. how long until java programmers become the COBOL programmers of today?
whats "worth" learning depends on what you want to do and whats happening in the industry currently. imo.
I'd recommend to register both domains for a few bucks and ask again with naming the actual working titles.
I think I personally would prefer the serious name.
For your logo: we got ours from http://www.designcontest.net/ - you pay $150 (or as much more as you like to) plus I think about $20 fee and describe what you want. You get several logo concepts from several artists and can comment on them. When you finally really like one of the logos, you close the contest and the logo is yours. Have a look at the forums (http://www.designcontest.net/forum/).
Enumerating the Sudoku 9×9 grid solutions directly
The first approach taken historically to enumerate Sudoku solutions (Enumerating possible Sudoku grids by Felgenhauer and Jarvis) was to analyze the permutations of the top band used in valid solutions. Once the Band1 symmetries and equivalence classes for the partial grid solutions were identified, the completions of the lower two bands were constructed and counted for each equivalence class. Summing completions over the equivalence classes, weighted by class size, gives the total number of solutions as 6,670,903,752,021,072,936,960 (6.67×1021). The value was subsequently confirmed numerous times independently. The Algorithm details section (below) describes the method.