How to make a good chess move

How to calculate chess positions?

“The grandmaster's secret” is what every average chess player will want to know. But unfortunately there is no "secret" for evaluating chess positions with high accuracy. We just need to change the view by which we look at the board while evaluating. But that's also not going to be easy. Only extensive practical experience on applying the methods described in this article will improve the player's playing strength. This article is not written by an experienced rated chess player of any sort, the author just play chess and analyses chess to some degree. And the author does not claim that the methods presented in this article are standardized theoretical methods. 

Analysis on shell sorting algorithm's worse case

Analysis on shell sorting algorithm's worse case

Dear reader,

Before we get to the main part of this post, I would like to share my experience learning this algorithm. I am a student doing my computer science engineering, and this concept of shell sorting is a part of my first year syllabus. I couldn't initially understand why shell sort runs faster than insertion sort, given that shell sort tends to insertion sort algorithm if the separation by which the system does the sorting procedure reaches one. On all cases, it does reach one and the same kind of iterations as of insertion sorting algorithm is found to take place. So this question had bothered me for a two days after since I had come across it. But now, I am completely clarified with that doubt. Because I found it difficult to understand why shell sorting algorithm proceeds faster than insertion sorting algorithm when I was learning this algorithm, I would be able to give a better view on shell sorting algorithm, in a way that you don't face the same problem I had faced.
Yours,
 K Sreram.