i didnt want to beat a dead horse but since the thread is still active, here is a generalisaion of the problem and the calculation:
Suppose you have N bowls, each containing B_i black stones and W_i Whits stones.
You randomly pick a Bowl, then extract a stone. if the stone turns out to be Black, what is the probability of having picked bowl i (1<i<=n)?
ie we want P(i|

)
(its the setup propose by shape and aji above, but with a different question)
Note that the original problem is a special case of this one,
with N=3
B_1=0,W_1=2
B_2=1,W_1=1
B_2=0,W_1=2
The question "if we pick a black stone, what the probability that the remaining one is black" is equivalent to looking for P(1|

)
here shortcuts mentionned above are no use, so we need to rely on bayse theorem
P(i|

) =P(

|i ) P(i)/P(

)
Now obviously we have P(i)=1/N (probability of picking bowl i)
P(

) is interesting
we can view the "event "we picked a black stone" as the union of the disjoin events " we picked a black stone form bowl k"
So
P(

)= sum (k) P(:black:|k)P(k)
with P(k)=1/N
finally for any bowl P(:black:|k) =B(k)/(B(k)+W(k))
so
P(i|

) =P(

|i )/(sum_K P(

|k))
with P(

|k)) = B(k)/(B(k)+W(k))
Here we find some nice properties and can answer various questiosn that were a bit unclear on the 3 bowl example:
-the sum overall i of the P(i|

) is 1 (of course)
-The result does not depend directly of N so you can add as many bowl with P(:black:|k)= 0 without changing the result ( case of removing the 3rd bowl in hte original problem)- adding B stones to a bowl containing only black stones changes nothing: its goes with the intuition.
- Of course we retrieve our special 3 bowl case:
P(1|

) = 1/(1+0.5+0)=2/3
something that may be counter intuitive at first sight: P(1|

)+ P(1|:white: ) is not 1

actually i am a bit puzzled by this
Now we understand what really makes the "stone counting" argument works, and how to correct the formula when it does not:
What matters is B(k)/(B(k)+W(k)), the proportion of black stones in each bowl, NOT the total number of B stones in the bowl alonne.
The simplification in Daal argument above is that, IF every bowl have the same number of stones, ie B(k)+W(k) is the same for each bowl, you can simplify the general formula above and get:
P(i|

) = B(i)/Sum(B(k))
Here you directly get again , for hte original problem:
P(1|

)= 2/(2+1+0)= 2/3
i think that when one starts to have some intution about a problem, putting some numbers done in a general case helps refine the intuition