Skip to main content

CS 1.6 all servers taken down


CS 1.6 , most probably is the first game that any gamer played. The game contains sentiments and lot of emotions. Those days were marvelous when all friends gather at one place connect their PC's with LAN and the play CS 1.6. Those shouting, abusing, taunting were the things that made the playing more interesting and we all remember the stuff we do while those hang outs and after the game is over we all try to pull each others legs my telling the tales about the stuff we did while playing and the number of ways we killed other or how stupid someone else's game was.
Well all of this, all the fun and joy have ended now because ESEA (E-Sports Entertainment Association League) has put out a statement announcing that they are officially shutting down servers for Counter Strike 1.6.


Here’s the announcement from their website:
When ESEA was founded, the only game it supported was Counter-Strike 1.6. Although Counter-Strike had already solidified itself as one of the founders of e-sports, the growth since its infancy has been staggering. Through all iterations of Counter-Strike, Counter-Strike 1.6 has long been a fan favorite and will go down as one of the best games ever made, period.
In 2014 we officially shut down all CS:S servers, and today we do the same for Counter-Strike 1.6. For many of us Counter-Strike 1.6 has played a large role in our life, from being the basis of lifetime friendships to developing e-sports legends that many of us still look up to today. It ultimately is what allowed ESEA to be what it is today. 
As a token of our appreciation for all of those who have been with us since the start, all current ESEA Premium and Insider members who have previously played a Counter-Strike 1.6 pug, before matchmaking was released, will have a special badge placed on their profile in the near future. 
The future is bright for Counter-Strike in esports, and Counter-Strike is here to stay with Global Offensive leading the way. It’s not going anywhere and neither is ESEA. Here’s to another 14 more years, and beyond!
You can however, still play the game, it’s just the official ESEA servers that are down.

Comments

Post a Comment

Popular posts from this blog

1235. Maximum Profit in Job Scheduling

Hi everyone, Today's post is little bit intriguing to me as it took me some time to get t the solution. I have been out of practice for a bit so I was not able to do it in the DP. I didn't want to copy the code. Though i understood the code after i checked its solution in the discussions. Anyways, i tried to do it with heap and with some thinking I was able to do it and with my surprise It performed real well. I would like to jump to the solution but first I would like to explain a little bit about heaps so you can get better understanding of the code. A heap is like a special type of list where the smallest (or largest) item is always at the front. Think of it like a priority line at a theme park, where the person with the highest priority goes to the front. There are two types of heaps: Min Heap: The smallest item is at the front. It's like standing in a line where the shortest person is always at the front. Max Heap: The largest item is at the front. It's like stand
2 comments
Read more

1456, Maximum Number of Vowels in a Substring of Given Length

Hi, folks today I am here with an interesting coding problem from Leetcode. *To directly go to the question please click here. So I will walk through the solution. It will be a brute force and an optimized way solution. I will be explaining the optimized way solutions in depth. # Intuition For any substring of length k, we need to find how many vowels are there in it and provide the highest count of all counts of vowels in a substring. Test Case 1 Input k = 2 and s='asjdee' Output - 2 Explanation: As for substring of length k=2, in the string 's' we have 'ee' when the length is k and the vowels count is 2 Test Case 2 Input k=3 and s='aasdiisdwe' Output - 2 Explanation - For all the substrings with length k = 3 we have 'aas' and 'dii' with 2 vowels each in it. Brute Force - Looping (twice) - Gives TLE (Not recommended) # Approach Create a hashmap (dictionary) with all the vowels in it. Loop through the string till len(s)-k element of strin
Post a Comment
Read more

1287. Element Appearing More Than 25% In Sorted Array

Hi, Today i bring you new Leetcode problem. Its an easy one :) The problem is - Element Appearing More Than 25% In Sorted Array As qs. explains itself we need to find a number that appears 25% times or more than the length of he array. So for example if array has length of 8 then the resultant number should appear 2 or more times. The constraints given are - 1 <= arr.length <= 100, 0 <= arr[i] <= 10 5 So, lets look at the cases which we may encounter. 1. if length is 1. then the number itself is the result. 2. if length is divisibe by 4 3. if length is not divisible by 4. Let's look at the code now...  class Solution : def findSpecialInteger ( self , arr : List[ int ]) -> int : n = len (arr) start = 0 end = n hm = defaultdict() for i in arr: hm[i] = hm.get(i, 0 )+ 1 for i in hm: if hm[i]>n// 4 : return i Now we will go through the code. Step 1: Initializatio
Post a Comment
Read more