see at: http://216.25.93.108/forum/viewtopic.ph ... 53&t=13472, where Fernando stated on SMIRF: ... It is even weaker than CC7 ...
Which engine of minimum strength has to be beaten by SMIRF to refute his claim?
Regards, Reinhard.
How to disprove Fernando's proposition ... ?
Moderator: Ras
-
- Posts: 484
- Joined: Mon Mar 13, 2006 11:08 am
- Location: Klein-Gerau, Germany
-
- Posts: 91
- Joined: Fri Mar 10, 2006 9:32 am
- Location: Amersfoort
Re: How to disprove Fernando's proposition ... ?
Hi Reinhard,
It is hard to tell how strong your engine is, because it is a non-UCI or even WB.
If you made an UCI the computerchessjunkies could play some enginematches.
Best wishes,
Andre
It is hard to tell how strong your engine is, because it is a non-UCI or even WB.



If you made an UCI the computerchessjunkies could play some enginematches.
Best wishes,
Andre
-
- Posts: 10121
- Joined: Thu Mar 09, 2006 12:57 am
- Location: van buren,missouri
Re: How to disprove Fernando's proposition ... ?
I beat chess Alex without to much trouble. However i have playedsmrf wrote:see at: http://216.25.93.108/forum/viewtopic.ph ... 53&t=13472, where Fernando stated on SMIRF: ... It is even weaker than CC7 ...
Which engine of minimum strength has to be beaten by SMIRF to refute his claim?
Regards, Reinhard.
over 20 or more games with SMIRF and only able to beat it once
and get one draw. I Like your engine. Thanks.
Gerold.
P.S. As for the elo i am guessing it to be around 2300 or more.
-
- Posts: 484
- Joined: Mon Mar 13, 2006 11:08 am
- Location: Klein-Gerau, Germany
Re: How to disprove Fernando's proposition ... ?
Hi André,
Regards, Reinhard.
the reason for that has been explained repeatedly by me. And thus I am willing to do that test myself. But I need a to be beaten engine named, from which is known to be better than CC7.André van Ark wrote:It is hard to tell how strong your engine is, because it is a non-UCI or even WB.![]()
![]()
As already told: if someone would make an 8x8 and 10x8 aware UCI extended GUI, there would be a UCI SMIRF soon.André van Ark wrote:If you made an UCI the computerchessjunkies could play some enginematches.
Regards, Reinhard.
-
- Posts: 8755
- Joined: Sun Feb 26, 2006 4:07 pm
Re: How to disprove Fernando's proposition ... ?
Dear ReinhardT:
I am available for that if you wish. I only want to be disproved, to be proved as wrong. I have not intention to dismiss nothing, I just expressed my impression after to weird moves by the engine.
I am sure you will at last create a very strong engine.
My best
Fernando
I am available for that if you wish. I only want to be disproved, to be proved as wrong. I have not intention to dismiss nothing, I just expressed my impression after to weird moves by the engine.
I am sure you will at last create a very strong engine.
My best
Fernando
-
- Posts: 484
- Joined: Mon Mar 13, 2006 11:08 am
- Location: Klein-Gerau, Germany
Re: How to disprove Fernando's proposition ... ?
Hi Fernando,
It is not important to know SMIRF's exact strength now, because - as you have stated - SMIRF nevertheless has to be rewritten and improved as "Octopus" (I intend), SMIRF yet is my first written and often repaired multivariant chess engine.
Of course SMIRF still is making doubtful moves from time to time, because I still have to learn on chess programming persuing with own and thus not sufficiently sophisticated methods. One goal is to avoid any pruning outside of Q-search. Actually nullmove pruning is used only very rarely in SMIRF, because it does no longer help that much to shape the search tree.
Regards, Reinhard.
would an elo 2200 engine be an opponent helpful for that? Or make another proposal for a representative engine above CC7's strength.fern wrote:... I only want to be disproved, to be proved as wrong. ...
It is not important to know SMIRF's exact strength now, because - as you have stated - SMIRF nevertheless has to be rewritten and improved as "Octopus" (I intend), SMIRF yet is my first written and often repaired multivariant chess engine.
Of course SMIRF still is making doubtful moves from time to time, because I still have to learn on chess programming persuing with own and thus not sufficiently sophisticated methods. One goal is to avoid any pruning outside of Q-search. Actually nullmove pruning is used only very rarely in SMIRF, because it does no longer help that much to shape the search tree.
Regards, Reinhard.
-
- Posts: 9773
- Joined: Wed Mar 08, 2006 8:44 pm
- Location: Amman,Jordan
Re: How to disprove Fernando's proposition ... ?
Hi Reinhard,
Good luck in your future development of Smirf....
Cheers,
Dr.Wael Deeb
Good luck in your future development of Smirf....
Cheers,
Dr.Wael Deeb
_No one can hit as hard as life.But it ain’t about how hard you can hit.It’s about how hard you can get hit and keep moving forward.How much you can take and keep moving forward….
-
- Posts: 484
- Joined: Mon Mar 13, 2006 11:08 am
- Location: Klein-Gerau, Germany
Re: How to disprove Fernando's proposition ... ?
Hi Gerold,
Regards, Reinhard.
you're welcome! There still is also a free donationware version to make SMIRF publicly testable. Moreover thank you for your elo estimation. I will try to select an elo - milestone opponent for SMIRF.gerold wrote:... I Like your engine. Thanks. ...
Regards, Reinhard.
-
- Posts: 484
- Joined: Mon Mar 13, 2006 11:08 am
- Location: Klein-Gerau, Germany
Re: How to disprove Fernando's proposition ... ?
Hi Dr. WD,
thank you for encouraging me! But SMIRF / Octopus will still need a lot of time ...
Regards, Reinhard.
thank you for encouraging me! But SMIRF / Octopus will still need a lot of time ...
Regards, Reinhard.
-
- Posts: 8755
- Joined: Sun Feb 26, 2006 4:07 pm
Re: How to disprove Fernando's proposition ... ?
It would be. I look forward...
My best
Fernando
My best
Fernando