• Log InLog In
  • Register
Liquid`
Team Liquid Liquipedia
EDT 12:25
CEST 18:25
KST 01:25
  • Home
  • Forum
  • Calendar
  • Streams
  • Liquipedia
  • Features
  • Store
  • EPT
  • TL+
  • StarCraft 2
  • Brood War
  • Smash
  • Heroes
  • Counter-Strike
  • Overwatch
  • Liquibet
  • Fantasy StarCraft
  • TLPD
  • StarCraft 2
  • Brood War
  • Blogs
Forum Sidebar
Events/Features
News
Featured News
RSL Season 1 - Final Week6[ASL19] Finals Recap: Standing Tall12HomeStory Cup 27 - Info & Preview18Classic wins Code S Season 2 (2025)16Code S RO4 & Finals Preview: herO, Rogue, Classic, GuMiho0
Community News
Esports World Cup 2025 - Brackets Revealed10Weekly Cups (July 7-13): Classic continues to roll4Team TLMC #5 - Submission extension3Firefly given lifetime ban by ESIC following match-fixing investigation17$25,000 Streamerzone StarCraft Pro Series announced7
StarCraft 2
General
RSL Revival patreon money discussion thread The GOAT ranking of GOAT rankings Who will win EWC 2025? Weekly Cups (July 7-13): Classic continues to roll Esports World Cup 2025 - Brackets Revealed
Tourneys
FEL Cracov 2025 (July 27) - $8000 live event RSL: Revival, a new crowdfunded tournament series $5,100+ SEL Season 2 Championship (SC: Evo) WardiTV Mondays Sparkling Tuna Cup - Weekly Open Tournament
Strategy
How did i lose this ZvP, whats the proper response Simple Questions Simple Answers
Custom Maps
External Content
Mutation # 482 Wheel of Misfortune Mutation # 481 Fear and Lava Mutation # 480 Moths to the Flame Mutation # 479 Worn Out Welcome
Brood War
General
Flash Announces (and Retracts) Hiatus From ASL BGH Auto Balance -> http://bghmmr.eu/ BW General Discussion Starcraft in widescreen A cwal.gg Extension - Easily keep track of anyone
Tourneys
[Megathread] Daily Proleagues Cosmonarchy Pro Showmatches CSL Xiamen International Invitational [BSL20] Non-Korean Championship 4x BSL + 4x China
Strategy
Simple Questions, Simple Answers I am doing this better than progamers do.
Other Games
General Games
Stormgate/Frost Giant Megathread Path of Exile Nintendo Switch Thread CCLP - Command & Conquer League Project The PlayStation 5
Dota 2
Official 'what is Dota anymore' discussion
League of Legends
Heroes of the Storm
Simple Questions, Simple Answers Heroes of the Storm 2.0
Hearthstone
Heroes of StarCraft mini-set
TL Mafia
TL Mafia Community Thread Vanilla Mini Mafia
Community
General
US Politics Mega-thread Russo-Ukrainian War Thread Future of Porn Stop Killing Games - European Citizens Initiative Summer Games Done Quick 2025!
Fan Clubs
SKT1 Classic Fan Club! Maru Fan Club
Media & Entertainment
[Manga] One Piece Movie Discussion! Anime Discussion Thread [\m/] Heavy Metal Thread
Sports
Formula 1 Discussion TeamLiquid Health and Fitness Initiative For 2023 2024 - 2025 Football Thread NBA General Discussion NHL Playoffs 2024
World Cup 2022
Tech Support
Computer Build, Upgrade & Buying Resource Thread
TL Community
The Automated Ban List
Blogs
Men Take Risks, Women Win Ga…
TrAiDoS
momentary artworks from des…
tankgirl
from making sc maps to makin…
Husyelt
StarCraft improvement
iopq
Trip to the Zoo
micronesia
Customize Sidebar...

Website Feedback

Closed Threads



Active: 691 users

The Big Programming Thread - Page 929

Forum Index > General Forum
Post a Reply
Prev 1 927 928 929 930 931 1031 Next
Thread Rules
1. This is not a "do my homework for me" thread. If you have specific questions, ask, but don't post an assignment or homework problem and expect an exact solution.
2. No recruiting for your cockamamie projects (you won't replace facebook with 3 dudes you found on the internet and $20)
3. If you can't articulate why a language is bad, don't start slinging shit about it. Just remember that nothing is worse than making CSS IE6 compatible.
4. Use [code] tags to format code blocks.
mahrgell
Profile Blog Joined December 2009
Germany3943 Posts
December 10 2017 13:43 GMT
#18561
On December 10 2017 21:39 Excludos wrote:
Show nested quote +
On December 10 2017 20:40 sc-darkness wrote:
On December 10 2017 19:53 Hanh wrote:
On December 09 2017 22:46 sc-darkness wrote:
Mutability isn't difficult in C++. You just pass objects by const reference. I don't know how C# would do it though.


Practically, const is more trouble than what it is worth especially when working with 3rd party libraries that do not use constness.


I think you're a minority here. Most C++ developers appreciate const correctness. Yes, sometimes you can't pass a const reference but there will always be such cases even with your own C++ classes.


I mean it's not that difficult to just clone a const variable before passing it if that's needed. That said I rarely use it myself. It's not that difficult to keep track of a variable and just not set it again if you need to. And if it can be defined before compile I just use #define instead (That said I don't really have an opinion on the subject. It's more preference than anything else).


I still like to have function heads declaring references as const whenever possible.

Especially when revisiting old code or other people code, it is useful to know if this is passed as reference only to accelerate the code or if it is passed as reference because the function intends to modify it.

And no "if you want the variable to be kept intact, just clone it" is not a viable solution.
Excludos
Profile Blog Joined April 2010
Norway8060 Posts
December 10 2017 15:00 GMT
#18562
On December 10 2017 22:43 mahrgell wrote:
Show nested quote +
On December 10 2017 21:39 Excludos wrote:
On December 10 2017 20:40 sc-darkness wrote:
On December 10 2017 19:53 Hanh wrote:
On December 09 2017 22:46 sc-darkness wrote:
Mutability isn't difficult in C++. You just pass objects by const reference. I don't know how C# would do it though.


Practically, const is more trouble than what it is worth especially when working with 3rd party libraries that do not use constness.


I think you're a minority here. Most C++ developers appreciate const correctness. Yes, sometimes you can't pass a const reference but there will always be such cases even with your own C++ classes.


I mean it's not that difficult to just clone a const variable before passing it if that's needed. That said I rarely use it myself. It's not that difficult to keep track of a variable and just not set it again if you need to. And if it can be defined before compile I just use #define instead (That said I don't really have an opinion on the subject. It's more preference than anything else).


I still like to have function heads declaring references as const whenever possible.

Especially when revisiting old code or other people code, it is useful to know if this is passed as reference only to accelerate the code or if it is passed as reference because the function intends to modify it.

And no "if you want the variable to be kept intact, just clone it" is not a viable solution.


Never stated the last thing. I said "if you want to pass (or alter) a const variable, you can clone it". That is a perfectly viable solution. Cloning a variable is not what's going to bog down your program even in the slightest.
Deleted User 3420
Profile Blog Joined May 2003
24492 Posts
Last Edited: 2017-12-10 23:03:35
December 10 2017 22:57 GMT
#18563
here is a situation I have (python)

I have a set, with many tuples in it. each tuple is of form (a, b, c).

I want to find all tuples in the set of form (a, _, c).

I am guessing that python isn't going to let me use wildcards. So what is the best way to do this? I don't want to have to iterate the set, that defeats the point.

edit: To pre-empt a possible answer, I will say that I can't use a dictionary to solve this problem, because I already am using a dictionary to store my sets. The key for the dictionary is a, not (a,c), because I need to do lookups by a somewhere else.
Acrofales
Profile Joined August 2010
Spain17976 Posts
December 10 2017 23:21 GMT
#18564
filter and a lambda function?
mahrgell
Profile Blog Joined December 2009
Germany3943 Posts
December 10 2017 23:29 GMT
#18565
list/set comprehension?

[x for x in s if condition]
Neshapotamus
Profile Blog Joined May 2006
United States163 Posts
December 11 2017 02:18 GMT
#18566
On December 11 2017 07:57 travis wrote:
here is a situation I have (python)

I have a set, with many tuples in it. each tuple is of form (a, b, c).

I want to find all tuples in the set of form (a, _, c).

I am guessing that python isn't going to let me use wildcards. So what is the best way to do this? I don't want to have to iterate the set, that defeats the point.

edit: To pre-empt a possible answer, I will say that I can't use a dictionary to solve this problem, because I already am using a dictionary to store my sets. The key for the dictionary is a, not (a,c), because I need to do lookups by a somewhere else.


Assume by and b, you mean pattern matching any values instead of specific instances.

You already have a map with key of "a's"


thinking you dict[a] has data like this:
dict[a] = [
(a,x,b),(a,y,b),
(a,x,c),(a,y,c),
(a,x,d),(a,y,d),
]

thrids = set(map(dict[a], lambda x: x[2])) # [b,c,d]

filtered = filter(dict[a], lambda x: x[2] in thirds)

a_and_b = map(filtered , lambda x : (x[0], x[2])) # [(a,b),(a,b),(a,c),(a,c),(a,d),(a,d)]
or
a_and_b = [(x[0],x[1]) for x in filtered]

If you didn't and want to match a specific instance of b:

filtered = filter(dict[a], lambda x: x[2] == b)
a_and_b = [(x[0],x[1]) for x in filtered]

Why are you limited to only using 1 set?
Deleted User 3420
Profile Blog Joined May 2003
24492 Posts
Last Edited: 2017-12-11 02:56:56
December 11 2017 02:54 GMT
#18567
edit: nevermind, figured this problem out

anyways i will read those responses i promise, just super busy coding right this moment!
Deleted User 3420
Profile Blog Joined May 2003
24492 Posts
Last Edited: 2017-12-11 17:30:44
December 11 2017 17:27 GMT
#18568
Ok! replying to the answers

On December 11 2017 08:21 Acrofales wrote:
filter and a lambda function?


this is something i need to learn i've seen people doing it a bit but I didn't really understand what was going on

On December 11 2017 08:29 mahrgell wrote:
list/set comprehension?

[x for x in s if condition]


I think this will make me iterate through the set? I want to avoid having to do that so I can have that sweet O(1) lookup.


On December 11 2017 11:18 Neshapotamus wrote:

Assume by and b, you mean pattern matching any values instead of specific instances.

You already have a map with key of "a's"


thinking you dict[a] has data like this:
dict[a] = [
(a,x,b),(a,y,b),
(a,x,c),(a,y,c),
(a,x,d),(a,y,d),
]

thrids = set(map(dict[a], lambda x: x[2])) # [b,c,d]

filtered = filter(dict[a], lambda x: x[2] in thirds)

a_and_b = map(filtered , lambda x : (x[0], x[2])) # [(a,b),(a,b),(a,c),(a,c),(a,d),(a,d)]
or
a_and_b = [(x[0],x[1]) for x in filtered]

If you didn't and want to match a specific instance of b:

filtered = filter(dict[a], lambda x: x[2] == b)
a_and_b = [(x[0],x[1]) for x in filtered]

Why are you limited to only using 1 set?


more lambda stuff, I will have to read up on it.
I can't answer your actual question about only using 1 set, because my approach changed. But I wasn't only using one set, I was using many sets. I can't remember the details though.




Anyways, something I want to bring up. I've built a TSP algorithm that seems to give the optimal solution (as in, solves the problem). I've been working on methods for a while and all of them were focused on providing the actual answer, not just a best approximation.

Intuitively, it makes sense that it solves it to me. Mathematically, I get flustered when n gets large, I think I would need a math guy to help prove it. And I'd need to see if someone else has taken this approach. I compared it to brute force up to n=11 (any higher and brute force takes forever), about 100 times. It matched brute force every time.

The algorithm is not fast, but it is much much faster than brute force.
Analyzing the complexity would take some time, and I think there is a shitload of optimizing I can do. (hell, there may even be ways to creatively utilize the overall concept to drastically cut runtime down even more).

average runtimes (timing with a clock) looked like this. set up time (populating edges and loading imports) is included in both times.

n = 10
brute force: 12 seconds
mine: 3 seconds

n = 11
brute force: 75 seconds
mine: 12 seconds

n=12
brute force: I don't want to wait this long. I am guessing 25-30 minutes
mine: 1 minute, 5 seconds



Is this at all impressive, assuming the algorithm actually solves every tsp problem assigned?
I'll try a problem set from a repository tonight while I sleep. See if I can solve ~50 or something. I don't exactly have a super computer.
mahrgell
Profile Blog Joined December 2009
Germany3943 Posts
December 11 2017 17:34 GMT
#18569
Pick one:
[ ] use (hash based) set
[ ] do your search in O(1)
phar
Profile Joined August 2011
United States1080 Posts
Last Edited: 2017-12-12 03:55:58
December 12 2017 03:55 GMT
#18570
On December 12 2017 02:27 travis wrote:
n = 10
brute force: 12 seconds
mine: 3 seconds

n = 11
brute force: 75 seconds
mine: 12 seconds

n=12
brute force: I don't want to wait this long. I am guessing 25-30 minutes
mine: 1 minute, 5 seconds

Is this at all impressive, assuming the algorithm actually solves every tsp problem assigned?

Hard to say with low n. There exist a bunch of exact algorithms and heuristic solutions to tsp. Every exact solution is some variant of worst case 2^n * some additional polynomial. So make n large and it doesn't really matter. Smear some A* on that and call it day.

With your 3 data points (10,3); (11,12); (12,65), it sounds like it's still exponential?

If you managed to find a not-exponential exact solution to tsp, you should probably like, not post on this forum anymore, and go collect your fields medal and/or turing award. Also a million dollars.
Who after all is today speaking about the destruction of the Armenians?
Silvanel
Profile Blog Joined March 2003
Poland4726 Posts
Last Edited: 2017-12-12 08:38:49
December 12 2017 08:26 GMT
#18571
Why not both? He can collect awards and still post here!

Edit: Not that i am making fun of Travis. I dont know shit about algorithms.
Pathetic Greta hater.
Manit0u
Profile Blog Joined August 2004
Poland17249 Posts
December 12 2017 15:32 GMT
#18572
On December 12 2017 17:26 Silvanel wrote:
Why not both? He can collect awards and still post here!

Edit: Not that i am making fun of Travis. I dont know shit about algorithms.


Algorithms are for pussies Real men solve their problems the hard way.
Time is precious. Waste it wisely.
mahrgell
Profile Blog Joined December 2009
Germany3943 Posts
December 12 2017 15:52 GMT
#18573
On December 13 2017 00:32 Manit0u wrote:
Show nested quote +
On December 12 2017 17:26 Silvanel wrote:
Why not both? He can collect awards and still post here!

Edit: Not that i am making fun of Travis. I dont know shit about algorithms.


Algorithms are for pussies Real men solve their problems the hard way.


Somehow when you say that, I'm picturing my grandpa, who when given 2 dozen German cities and the task to drive the shortest route, would claim to know this perfect route faster than any algorithm could even process the input.

And then he would start driving without ever looking back and having a single doubt.
I guess this could then be described as "the hard way" for any potential co-drivers.

raNazUra
Profile Joined December 2012
United States10 Posts
December 12 2017 22:31 GMT
#18574
On December 12 2017 12:55 phar wrote:
Show nested quote +
On December 12 2017 02:27 travis wrote:
n = 10
brute force: 12 seconds
mine: 3 seconds

n = 11
brute force: 75 seconds
mine: 12 seconds

n=12
brute force: I don't want to wait this long. I am guessing 25-30 minutes
mine: 1 minute, 5 seconds

Is this at all impressive, assuming the algorithm actually solves every tsp problem assigned?

Hard to say with low n. There exist a bunch of exact algorithms and heuristic solutions to tsp. Every exact solution is some variant of worst case 2^n * some additional polynomial. So make n large and it doesn't really matter. Smear some A* on that and call it day.

With your 3 data points (10,3); (11,12); (12,65), it sounds like it's still exponential?

If you managed to find a not-exponential exact solution to tsp, you should probably like, not post on this forum anymore, and go collect your fields medal and/or turing award. Also a million dollars.

Essentially this.

As a side note, if you check the Wikipedia page, it mentions that there's an early dynamic programming solution that is O(n^2 * 2^n), while the brute force solution is O(n!). If you look at those two running times while ignoring constants, you get something like this:

n n! n^2*2^n
0 1 0
1 1 2
2 2 16
3 6 72
4 24 256
5 120 800
6 720 2304
7 5040 6272
8 40320 16384
9 362880 41472
10 3628800 102400
11 39916800 247808

in which the dynamic programming solution starts overtaking brute force around n=7, and really beating it as you get up into the 9-11 range. Without a larger sample size from your algorithm vs. brute force or the algorithm itself, we can't say if you've got a qualitatively superior (but still exponential) solution like the DP one, or have just managed to bring down the constant on brute force.

If you want to post the approach, I'd be happy to see if I can find any flaws in the logic and/or prove it =) Algorithms was always my favorite subject.
Speak the truth, even if your voice shakes
Deleted User 3420
Profile Blog Joined May 2003
24492 Posts
December 13 2017 02:25 GMT
#18575
Do you guys think that inventors of algorithms should be able to patent them?

I read lots of arguments that no they shouldn't, but it doesn't seem any different than discoveries in other scientific fields, to me.

Furthermore, it would seem wrong for some scientist to develop an algorithm and then make little or no financial gain from it, while megacorporations with huge amounts of infastructure can immediately utilize it to increase their profits.
phar
Profile Joined August 2011
United States1080 Posts
Last Edited: 2017-12-13 03:54:29
December 13 2017 03:49 GMT
#18576
If you want the actual answer, from a patent law perspective, you want to do the following:

First read the old trilogy (Gottschalk v. Benson, Parker v. Flook, and Diamond v. Diehr).

And then go look up the recent-ish rulings on Mayo v. Prometheus, Alice v. CLS, and potentially Bilski v. Kappos. Long story short, it's not a purely settled matter yet. However:

Abstract ideas cannot be patented, that's a sure thing. Math, laws of nature, etc cannot be patented, that's a sure thing. As in Gottshalk v. Benson, pure algorithms tend to fall into those categories - not patentable. Meaning if you came up with an exponential solution to TSP, it probably would not be patentable.

That said, if you came up with a way of combining more complex software systems to do some novel thing, you can probably get a patent on it. Whether or not it would hold light in court with sufficient money thrown against you from the other side, is up to how novel your new system is, and maybe whether or not you draw Judge Aslup on the district court level


^ The above is not really my opinion on the way things should be, but rather the way things actually are for US patent law today. So I say this not as a computer person, but as second hand knowledge from someone else who knows a damn shit ton about patent law. So also I could be misremembering / misconstruing some things...



From a practical perspective, there is a reason why a lot of companies don't open source their core algorithms. Trade secrets yo. If a scientist comes up with a sufficiently brilliant algo, they can monetize. See e.g. Larry Page & Sergey Brin, who came up with PageRank, and now are the 12th & 13th richest people in the world.
Who after all is today speaking about the destruction of the Armenians?
Manit0u
Profile Blog Joined August 2004
Poland17249 Posts
December 13 2017 07:00 GMT
#18577
That's also why you can't really patent/copyright game mechanics since they're usually just math algorithms.
Time is precious. Waste it wisely.
Deleted User 3420
Profile Blog Joined May 2003
24492 Posts
December 13 2017 10:56 GMT
#18578
But how is that different than divising a formula or recipe for a chemical, medicine, material, etc? That's also just math. It's literally a an algorithm. So why is it commonly accepted that patents for this makes sense, but patents for digital recipes do not?

I think the distinction is arbitrary and unfair.

(that said, you actually can patent algorithms and ideas, if properly presented to the patent office. but you aren't supposed to be able to)
Excludos
Profile Blog Joined April 2010
Norway8060 Posts
December 13 2017 11:07 GMT
#18579
On December 13 2017 19:56 travis wrote:
But how is that different than divising a formula or recipe for a chemical, medicine, material, etc? That's also just math. It's literally a an algorithm. So why is it commonly accepted that patents for this makes sense, but patents for digital recipes do not?

I think the distinction is arbitrary and unfair.

(that said, you actually can patent algorithms and ideas, if properly presented to the patent office. but you aren't supposed to be able to)


Let's just be thankful that we can't. If people had the option of patenting algorithms we'd be set back years.
Acrofales
Profile Joined August 2010
Spain17976 Posts
December 13 2017 12:09 GMT
#18580
On December 13 2017 11:25 travis wrote:
Do you guys think that inventors of algorithms should be able to patent them?

I read lots of arguments that no they shouldn't, but it doesn't seem any different than discoveries in other scientific fields, to me.

Furthermore, it would seem wrong for some scientist to develop an algorithm and then make little or no financial gain from it, while megacorporations with huge amounts of infastructure can immediately utilize it to increase their profits.

If you come up with a genius algorithm, don't patent it, because it's probably an abstract idea and thus unpatentable.

Software patents are stupid, but the good ones cover novel systems and methods for solving real life problems. Now if your algorithm can do a million different things (as any truly good solution to the TSP can), then there is not much point in patenting it, because to patent it you also have to divulge it... and you don't want to do that, because that's giving away your unpatentable core technology that can be used for a million different things.

Instead, a brilliant new algorithm is kept as a trade secret and monetized. Either by turning it into a service (e.g. Watson) or by selling services based on it. You could try selling it as a product, but reverse engineering will probably figure out your magic, which is why web-based services is probably the way to go.

Either that, or accept that other people can implement your brilliant algorithm, and just become famous, but not rich off it.
Prev 1 927 928 929 930 931 1031 Next
Please log in or register to reply.
Live Events Refresh
WardiTV European League
16:00
Swiss Groups Day 4
ShoWTimE vs sebesdes
Percival vs NightPhoenix
Shameless vs Nicoract
Krystianer vs Scarlett
ByuN vs uThermal
Harstem vs HeRoMaRinE
WardiTV419
TKL 154
IndyStarCraft 128
Liquipedia
[ Submit Event ]
Live Streams
Refresh
StarCraft 2
mouzHeroMarine 426
SpeCial 310
TKL 154
IndyStarCraft 128
BRAT_OK 48
ForJumy 43
UpATreeSC 34
StarCraft: Brood War
Britney 32803
Rain 4157
EffOrt 1332
BeSt 1191
firebathero 645
Stork 403
Larva 216
Rush 205
Light 187
Mind 130
[ Show more ]
Trikslyr71
Aegong 71
PianO 66
sSak 46
Movie 41
GoRush 31
Shinee 30
JulyZerg 24
scan(afreeca) 19
yabsab 17
Terrorterran 9
Shine 5
SilentControl 5
Bale 4
ivOry 4
Dota 2
qojqva4012
monkeys_forever193
League of Legends
Dendi1705
Counter-Strike
sgares680
flusha210
Other Games
FrodaN3290
B2W.Neo2498
singsing2207
Beastyqt487
ceh9429
Lowko282
Fuzer 243
Pyrionflax130
ToD98
Skadoodle73
Mew2King69
QueenE62
ArmadaUGS55
elazer31
oskar21
Organizations
Other Games
gamesdonequick3521
StarCraft 2
Blizzard YouTube
StarCraft: Brood War
BSLTrovo
sctven
[ Show 13 non-featured ]
StarCraft 2
• AfreecaTV YouTube
• intothetv
• Kozan
• IndyKCrew
• LaughNgamezSOOP
• Migwel
• sooper7s
StarCraft: Brood War
• BSLYoutube
• STPLYoutube
• ZZZeroYoutube
Dota 2
• C_a_k_e 2498
League of Legends
• Nemesis3328
• Jankos1714
Upcoming Events
PiGosaur Monday
7h 35m
uThermal 2v2 Circuit
23h 35m
Replay Cast
1d 7h
The PondCast
1d 17h
WardiTV European League
1d 23h
Replay Cast
2 days
Epic.LAN
2 days
CranKy Ducklings
3 days
Epic.LAN
3 days
CSO Contender
4 days
[ Show More ]
BSL20 Non-Korean Champi…
4 days
Bonyth vs Sziky
Dewalt vs Hawk
Hawk vs QiaoGege
Sziky vs Dewalt
Mihu vs Bonyth
Zhanhun vs QiaoGege
QiaoGege vs Fengzi
Sparkling Tuna Cup
4 days
Online Event
4 days
BSL20 Non-Korean Champi…
5 days
Bonyth vs Zhanhun
Dewalt vs Mihu
Hawk vs Sziky
Sziky vs QiaoGege
Mihu vs Hawk
Zhanhun vs Dewalt
Fengzi vs Bonyth
Esports World Cup
6 days
ByuN vs Astrea
Lambo vs HeRoMaRinE
Clem vs TBD
Solar vs Zoun
SHIN vs Reynor
Maru vs TriGGeR
herO vs Lancer
Cure vs ShoWTimE
Liquipedia Results

Completed

2025 ACS Season 2: Qualifier
RSL Revival: Season 1
Murky Cup #2

Ongoing

JPL Season 2
BSL 2v2 Season 3
Copa Latinoamericana 4
Jiahua Invitational
BSL20 Non-Korean Championship
Championship of Russia 2025
FISSURE Playground #1
BLAST.tv Austin Major 2025
ESL Impact League Season 7
IEM Dallas 2025
PGL Astana 2025
Asian Champions League '25
BLAST Rivals Spring 2025
MESA Nomadic Masters

Upcoming

CSL Xiamen Invitational
CSL Xiamen Invitational: ShowMatche
2025 ACS Season 2
CSLPRO Last Chance 2025
CSLPRO Chat StarLAN 3
BSL Season 21
K-Championship
RSL Revival: Season 2
SEL Season 2 Championship
uThermal 2v2 Main Event
FEL Cracov 2025
Esports World Cup 2025
Underdog Cup #2
ESL Pro League S22
StarSeries Fall 2025
FISSURE Playground #2
BLAST Open Fall 2025
BLAST Open Fall Qual
Esports World Cup 2025
BLAST Bounty Fall 2025
BLAST Bounty Fall Qual
IEM Cologne 2025
TLPD

1. ByuN
2. TY
3. Dark
4. Solar
5. Stats
6. Nerchio
7. sOs
8. soO
9. INnoVation
10. Elazer
1. Rain
2. Flash
3. EffOrt
4. Last
5. Bisu
6. Soulkey
7. Mini
8. Sharp
Sidebar Settings...

Advertising | Privacy Policy | Terms Of Use | Contact Us

Original banner artwork: Jim Warren
The contents of this webpage are copyright © 2025 TLnet. All Rights Reserved.