_VEndeTta Wrote:I've been dying to try my hand at Emu, been brushing up on my Pentium 4 assembly
in anticipation. ;) If Daedelus doesn't get its head out of its butt, i was thinking of
learning ARM assembly (I think that's right) and pulling together a team of people who
know more than me to give a go at an N64 emulator.

Wow, I really have no idea how to code emulators - never really looked into ASM actually.
Good luck!  I'm sure tonnes of people would love you if you could get good improvements on the N64 emulator!

_VEndeTta Wrote:As for the source. Lulz. I don't have any VB IDE, so as long as I can open it in
notepad or something, that'd be awesome, I could see what techniques you used,
etc.

Yeah, text editors work.  The code's stored in frmMain.frm - just open that and search for

Quote:Private Sub Solve()

Anyways, the code's rather messy and probably could be optimized quite a bit - it was only written for fun and I didn't bother looking into making it fast (but the "algorithm order" should be about the same)

_VEndeTta Wrote:I did some in-depth research on Sudoku puzzles when I programmed one for a
Programming Competition

Oh, so that's how you know so much about Sudoku Solvers XD

_VEndeTta Wrote:I was trying to make the brute-force algorithm more
effecient, in truth I wanted to get it to linear time, and succeeded only partially. My
method was about 3 times faster then pure brute-force, which doesn't mean poo poo in
exponential time D:.

HOLY poo poo!  LINEAR TIME?  Wow, how did you manage to do that???
I don't think that's called "brute force" anymore if you could do that :P
wow.

_VEndeTta Wrote:By the way, if you want to break your sudoku solver, enter these initial values :

(address:value)

1,A:1
2,H:6
3,E:6
5,B:6
9,C:6

I actually found a few puzzles which couldn't be solved using normal methods.

Thanks for the reply.