That would really be great. My engine (Brainless), as of now, has a half-decent search (alpha-beta, quie, ID, non-recursive nullmove, TT, history heuristic, simple SEE, selective extension on checks) but the eval is really brain dead. I cannot vouch for the bug-free-ness of it, but I have watched it playing quite a few games on FICS (under the handle BrainlessChess, 2112 std, 1832 blitz) and I don't see anything wrong with it (I don't usually play against it, perhaps it's because of my 1200 rating...). It has not played any tournaments yet, though I have registered it for WBEC. I use rotated bitboards (many thanks to Dr. Hyatt) for move generation but also keep a 8x8 mailbox for other purposes. One problem is though, is that the code is not pretty by any standard =) (never knew that someone but me would see it). Please let me know if you are interested.BTW if You wish, I might try to write an evaluation function for Your program. Mine, called Hopeless, is of Chesswar "E" strength, despite being outsearched by just about any opponent. So it means that if it has anything good inside, it's eval.
I am more of a computer science guy than a chess guy, so I pay more attention to the search than to the eval.