Towers Of Hanoi Benchmark

vladimir · 19-March-04, 10:21 AM

Ok, so I got bored yesterday and decide to write something cool, what i ended up with is a benchmark

so far this is written in java, so you need to have SUN java installed, get it at http://www.java.com/en/index.jsp The reason you need sun java and not M$ virtual machine is because virtual machine is faster, and this would be considered cheating, since virtual machine is not available to all platforms.

In the zip file you will find TerminalIO.jar file, copy it to C:\Program Files\Java\j2re1.4.2_04\lib\ext\ (Default Java folder) or whatever dir you installed sun java \lib\ext\

What this program does is use Tower Of Hanoi algorithm to move rings from peg to peg to peg until all of them end up on the opposite peg that rings were originally started moving from. If you want to know more, just Google it, youÃ‚â€™ll find tons of results.

Format of the result is in hours:minutes:seconds.miliseconds, the smaller the number the better. This bench would keep your system @ 100% cpu.

Just to show some sample results on my systemÃ‚â€¦
To move 15 rings on my system p4 2.4gh it took 00:00:03.469
To move 20 rings on my system p4 2.4gh it took 00:01:51.172

So what the hell are you waiting for? Download the benchmark here, and post your time and system specs. Post results for 15 rings and 20 rings.

Created by CLowN (clownATpcapex.com) Ã‚Â© 2004

Dakas · 19-March-04, 06:12 PM

Heh...I wrote hanoi once, but in c++, for DOS. Very ghetto. One time we ran it all weekend to see if the P3 500s we had would finish. Sad to say, after a couple of days you'd get a stack space error. I blame the compiler. MY code never leaks memory...

19-March-04, 10:21 AM		#1 (permalink)
vladimir Pimp PHP Pro	Towers Of Hanoi Benchmark Ok, so I got bored yesterday and decide to write something cool, what i ended up with is a benchmark so far this is written in java, so you need to have SUN java installed, get it at http://www.java.com/en/index.jsp The reason you need sun java and not M$ virtual machine is because virtual machine is faster, and this would be considered cheating, since virtual machine is not available to all platforms. In the zip file you will find TerminalIO.jar file, copy it to C:\Program Files\Java\j2re1.4.2_04\lib\ext\ (Default Java folder) or whatever dir you installed sun java \lib\ext\ What this program does is use Tower Of Hanoi algorithm to move rings from peg to peg to peg until all of them end up on the opposite peg that rings were originally started moving from. If you want to know more, just Google it, youÃ‚â€™ll find tons of results. Format of the result is in hours:minutes:seconds.miliseconds, the smaller the number the better. This bench would keep your system @ 100% cpu. Just to show some sample results on my systemÃ‚â€¦ To move 15 rings on my system p4 2.4gh it took 00:00:03.469 To move 20 rings on my system p4 2.4gh it took 00:01:51.172 So what the hell are you waiting for? Download the benchmark here, and post your time and system specs. Post results for 15 rings and 20 rings. Created by CLowN (clownATpcapex.com) Ã‚Â© 2004

Thread Tools
Show Printable Version Email this Page
Display Modes
Linear Mode Switch to Hybrid Mode Switch to Threaded Mode

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Advice on Mid Towers	raydub	Hardware Advice Corner	2	12-March-07 10:39 PM
Anandtech // Value Cooling: Two Towers for under $30	Gizmo	Anandtech RSS	0	23-January-07 10:00 AM
Anandtech // A Trio of Thermaltake Towers	Gizmo	Anandtech RSS	0	16-August-06 03:00 AM
Exhaust towers - help	ratchetfps	Case Modding	41	26-June-06 04:57 PM
WANTED: Old Towers	Kratos	Trading Post	16	28-August-05 02:59 PM

19-March-04, 06:12 PM		#2 (permalink)
Dakas Apex Master Tech	Heh...I wrote hanoi once, but in c++, for DOS. Very ghetto. One time we ran it all weekend to see if the P3 500s we had would finish. Sad to say, after a couple of days you'd get a stack space error. I blame the compiler. MY code never leaks memory...