Clear coding ?

[Guenther]

I don't think Henk is a trol. He wrote a chess engine that plays valid moves. I know because I saw my program play against his twice via hgm's server. Ok that is not 100% guarantee.

You may think his question is silly but hey haven't we all asked a "silly" question in our lifetimes?

I also think it is not very nice to have this discussion.

I must ask though, for how many years you think one may ask silly
questions?. Is a value over 2 years plausible enough for getting a
certain verdict attached? Most here think those 'silly' questions are
simply not serious.

[mcostalba]

It's about creating a new transposition table using an immutable one. So
nextImmutableTTable = Insert (prevImmutableTTable, entry);

I don't know it that can be implemented more efficiently than O(log n) otherwise we get Insert(/*mutable*/ TTable, entry)

Hello Roger,

sorry to be a bit direct, but now I think that he is really joking you, taking advantage you are not a programmer.

I'd suggest to ask to the other moderators for their comments.

Thanks
Marco

[Michel]

It is clear that Henk enjoys playing(!) the role of the village idiot on this forum. And just like the village idiot his presence is benign and generally entertaining!

[lucasart]

Maybe it's best to simply write

Code: Select all

a && ( b 
          || c 
         ) 

instead of

Code: Select all

a && ( 
          b 
          || c 
         ) 

for it makes it more difficult to make a compile error.

If that's not trolling, what is?

[Henk]

Maybe it's best to simply write

Code: Select all

a && ( b 
          || c 
         ) 

instead of

Code: Select all

a && ( 
          b 
          || c 
         ) 

for it makes it more difficult to make a compile error.

If that's not trolling, what is?

If you are rewriting main classes of your chess engine you easily get a large number of compile errors. Last week I had 480 compile errors because I changed the position class. If you have to correct 480 compile errors you usually don't spent much time on each one. After a while you may become less careful. If you have code in the right format it is easier to correct them.

[Roger Brown]

It's about creating a new transposition table using an immutable one. So
nextImmutableTTable = Insert (prevImmutableTTable, entry);

I don't know it that can be implemented more efficiently than O(log n) otherwise we get Insert(/*mutable*/ TTable, entry)

Hello Roger,

sorry to be a bit direct, but now I think that he is really joking you, taking advantage you are not a programmer.

I'd suggest to ask to the other moderators for their comments.

Thanks
Marco

Hello Marco,

Apologies not required.

Point noted.

Done.

Later.

Ps. The thread has suffered degradation. Following clean-up, including my own unfortunate attempts at clarification, it should be unlocked.