Towers of Dawnoi

While washing dishes the other night, it occurred to me that I was unconsciously solving a modified Tower of Hanoi problem. I had three "posts": the two sink basins and the dish drainer. There were a bunch of plates randomly stacked on the first two, and my goal was to move all of them onto the third, large to small.

The rules:

• I can move multiple plates at a time between the two basin posts, but for stability reasons I can't place a stack containing a larger plate atop one containing a smaller one.
  
• I can only move one plate at a time onto the drainer post (since I can only wash one at a time).
  
• Once a plate goes onto the third post, it can't be moved again. (Practically speaking, this means I have to wash the largest plates first.)
  

Okay, it's not a particularly interesting or difficult problem, but I was amused at myself.