On my web-site, you can download the full sources of Freccia, my old assembly engine.
Do whatever you want with this sources but not for commercial use.
Christmas gift
Moderators: hgm, Rebel, chrisw
-
- Posts: 859
- Joined: Mon Aug 10, 2009 10:05 pm
- Location: Italy
- Full name: Stefano Gemma
Christmas gift
Author of Drago, Raffaela, Freccia, Satana, Sabrina.
http://www.linformatica.com
http://www.linformatica.com
-
- Posts: 3196
- Joined: Fri May 26, 2006 3:00 am
- Location: WY, USA
- Full name: Michael Sherwin
Re: Christmas gift
Hi Stefano,
My system: i7-3930K 3.20 Ghz overclocked to 3.8 Ghz
I also have some assembly code but all the further I got with it was a bench function. It was created on a 80386 processor. It is one of 4 move generator examples that I wrote when I was teaching myself to program. You might find it interesting. I got it to compile in MSVC 2017 but there is a minor bug somewhere. It will still bench but it does not make the list of pseudo legal moves correctly. There are no tricks to make it look faster. For example the leaf node moves are made and unmade. I was told that the leaf nodes should not be made, only counted. I can't even guesstimate how fast it would be if the leaf nodes were not made. It was originally compiled with Turbo C and Turbo assembler. Here are the bench results on the system listed above.
Single thread of execution.
bench 5 time = 79 mili seconds nps 64399832
bench 6 time = 1957 mili seconds nps 63898476
bench 7 time = 52856 mili seconds nps 63336796
If you are interested I can send you the zip file with code and exe? It is not commented, sorry I was just learning to program.
My system: i7-3930K 3.20 Ghz overclocked to 3.8 Ghz
I also have some assembly code but all the further I got with it was a bench function. It was created on a 80386 processor. It is one of 4 move generator examples that I wrote when I was teaching myself to program. You might find it interesting. I got it to compile in MSVC 2017 but there is a minor bug somewhere. It will still bench but it does not make the list of pseudo legal moves correctly. There are no tricks to make it look faster. For example the leaf node moves are made and unmade. I was told that the leaf nodes should not be made, only counted. I can't even guesstimate how fast it would be if the leaf nodes were not made. It was originally compiled with Turbo C and Turbo assembler. Here are the bench results on the system listed above.
Single thread of execution.
bench 5 time = 79 mili seconds nps 64399832
bench 6 time = 1957 mili seconds nps 63898476
bench 7 time = 52856 mili seconds nps 63336796
If you are interested I can send you the zip file with code and exe? It is not commented, sorry I was just learning to program.
If you are on a sidewalk and the covid goes beep beep
Just step aside or you might have a bit of heat
Covid covid runs through the town all day
Can the people ever change their ways
Sherwin the covid's after you
Sherwin if it catches you you're through
Just step aside or you might have a bit of heat
Covid covid runs through the town all day
Can the people ever change their ways
Sherwin the covid's after you
Sherwin if it catches you you're through