🚀 go-pugleaf

Greeting computer-chess people,

I have just spent the last day and a half programming my PC 
to solve non standard chess problems (helpmate/selfmate...) 
but have come to the conclusion that the language that I'm 
using (compiler Basic) or my programming efficiency is not 
up to the task.  Problems like this require an exhaustive search 
and the number of positions generated can be very large.

But you already new that. 

Has someone already done this or is it a simple matter of 
modifying the GNU program (or similar) to do it?

Any advise would be appreciated.

Chappy.