• Log InLog In
  • Register
Liquid`
Team Liquid Liquipedia
EDT 05:25
CEST 11:25
KST 18: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
Code S Season 1 - RO12 Group A: Rogue, Percival, Solar, Zoun12[ASL21] Ro8 Preview Pt1: Inheritors16[ASL21] Ro16 Preview Pt2: All Star10Team Liquid Map Contest #22 - The Finalists22[ASL21] Ro16 Preview Pt1: Fresh Flow9
Community News
RSL Revival: Season 5 - Qualifiers and Main Event4Code S Season 1 (2026) - RO12 Results02026 GSL Season 1 Qualifiers25Maestros of the Game 2 announced92026 GSL Tour plans announced15
StarCraft 2
General
Code S Season 1 (2026) - RO12 Results Code S Season 1 - RO12 Group A: Rogue, Percival, Solar, Zoun Team Liquid Map Contest #22 - The Finalists Blizzard Classic Cup @ BlizzCon 2026 - $100k prize pool MaNa leaves Team Liquid
Tourneys
RSL Revival: Season 5 - Qualifiers and Main Event GSL Code S Season 1 (2026) SC2 INu's Battles#15 <BO.9 2Matches> WardiTV Spring Cup SEL Masters #6 - Solar vs Classic (SC: Evo)
Strategy
Custom Maps
[D]RTS in all its shapes and glory <3 [A] Nemrods 1/4 players [M] (2) Frigid Storage
External Content
The PondCast: SC2 News & Results Mutation # 523 Firewall Mutation # 522 Flip My Base Mutation # 521 Memorable Boss
Brood War
General
ASL21 General Discussion BGH Auto Balance -> http://bghmmr.eu/ Pros React To: Leta vs Tulbo (ASL S21, Ro.8) [BSL22] RO16 Group A - Sunday 21:00 CEST [BSL22] RO16 Group B - Saturday 21:00 CEST
Tourneys
Escore Tournament StarCraft Season 2 [BSL22] RO16 Group Stage - 02 - 10 May [Megathread] Daily Proleagues [ASL21] Ro8 Day 2
Strategy
Fighting Spirit mining rates Simple Questions, Simple Answers What's the deal with APM & what's its true value Any training maps people recommend?
Other Games
General Games
Daigo vs Menard Best of 10 Stormgate/Frost Giant Megathread Nintendo Switch Thread Dawn of War IV Diablo IV
Dota 2
The Story of Wings Gaming
League of Legends
G2 just beat GenG in First stand
Heroes of the Storm
Simple Questions, Simple Answers Heroes of the Storm 2.0
Hearthstone
Deck construction bug Heroes of StarCraft mini-set
TL Mafia
Vanilla Mini Mafia Mafia Game Mode Feedback/Ideas TL Mafia Community Thread Five o'clock TL Mafia
Community
General
US Politics Mega-thread European Politico-economics QA Mega-thread Russo-Ukrainian War Thread 3D technology/software discussion Canadian Politics Mega-thread
Fan Clubs
The IdrA Fan Club
Media & Entertainment
[Manga] One Piece Anime Discussion Thread [Req][Books] Good Fantasy/SciFi books Movie Discussion!
Sports
2024 - 2026 Football Thread McBoner: A hockey love story Formula 1 Discussion
World Cup 2022
Tech Support
streaming software Strange computer issues (software) [G] How to Block Livestream Ads
TL Community
The Automated Ban List
Blogs
Sexual Health Of Gamers
TrAiDoS
lurker extra damage testi…
StaticNine
Broowar part 2
qwaykee
Funny Nicknames
LUCKY_NOOB
Iranian anarchists: organize…
XenOsky
Customize Sidebar...

Website Feedback

Closed Threads



Active: 1806 users

[SFW] Riddles / Puzzles / Brain Teasers - Page 5

Forum Index > General Forum
Post a Reply
Prev 1 2 3 4 5 6 7 36 37 38 Next All
Krowser
Profile Joined August 2007
Canada788 Posts
April 18 2012 17:50 GMT
#81

Riddle 3:

An Arab sheikh tells his two sons to race their camels to a distant city to see who will inherit his fortune. The one whose camel is slower wins. After wandering aimlessly for days, the brothers ask a wise man for guidance. Upon receiving the advice, they jump on the camels and race to the city as fast as they can. What did the wise man say to them?

Solution:
+ Show Spoiler +
Switch camels


Is it just me or this riddle doesn't make sense. Something is up with the structure.

It's like saying:

A single mom has two kids, a boy and a girl. The mother always had a fancy for cake but she never wore blue coloured coveralls.

How old is the bus driver?
D3 and Pho, the way to go. http://www.teamliquid.net/forum/viewmessage.php?topic_id=340709
DarkPlasmaBall
Profile Blog Joined March 2010
United States45772 Posts
April 18 2012 17:55 GMT
#82
On April 19 2012 02:50 Krowser wrote:
Show nested quote +

Riddle 3:

An Arab sheikh tells his two sons to race their camels to a distant city to see who will inherit his fortune. The one whose camel is slower wins. After wandering aimlessly for days, the brothers ask a wise man for guidance. Upon receiving the advice, they jump on the camels and race to the city as fast as they can. What did the wise man say to them?

Solution:
+ Show Spoiler +
Switch camels


Is it just me or this riddle doesn't make sense. Something is up with the structure.

It's like saying:

A single mom has two kids, a boy and a girl. The mother always had a fancy for cake but she never wore blue coloured coveralls.

How old is the bus driver?


I don't see what the problem is, but maybe I can clarify: the sheikh has decided to give his fortune to exactly one of his two sons. Who he gives it to will be decided by a competition between the two boys. The competition is a race on camels, but it's not who can get to the city first... it's whoever's camel is slower will be the victor. The two sons must figure out a way to decide that out, as each one wants to obtain the fortune.
"There is nothing more satisfying than looking at a crowd of people and helping them get what I love." ~Day[9] Daily #100
cmen15
Profile Blog Joined December 2010
United States1519 Posts
April 18 2012 18:03 GMT
#83
On April 19 2012 01:36 Geo.Rion wrote:
Show nested quote +
On April 18 2012 23:44 Ghanburighan wrote:
[image loading]

+ Show Spoiler [Hint] +
Count something


+ Show Spoiler [solution] +
Count the number of circles in the numbers, for example 8 has two.

damn, i arrived at the right conclusion,+ Show Spoiler +
2, but didnt notice it has anything to do with circles, i simply noticed the numbers have a "weight" most of them 0, so i went on and discovered 6, 9, 0 had a "weight" of one, and 8 has "2".

Wow... dude I like your way much better : )
Greed leads to just about all losses.
Krowser
Profile Joined August 2007
Canada788 Posts
April 18 2012 18:03 GMT
#84
On April 19 2012 02:55 DarkPlasmaBall wrote:
Show nested quote +
On April 19 2012 02:50 Krowser wrote:

Riddle 3:

An Arab sheikh tells his two sons to race their camels to a distant city to see who will inherit his fortune. The one whose camel is slower wins. After wandering aimlessly for days, the brothers ask a wise man for guidance. Upon receiving the advice, they jump on the camels and race to the city as fast as they can. What did the wise man say to them?

Solution:
+ Show Spoiler +
Switch camels


Is it just me or this riddle doesn't make sense. Something is up with the structure.

It's like saying:

A single mom has two kids, a boy and a girl. The mother always had a fancy for cake but she never wore blue coloured coveralls.

How old is the bus driver?


I don't see what the problem is, but maybe I can clarify: the sheikh has decided to give his fortune to exactly one of his two sons. Who he gives it to will be decided by a competition between the two boys. The competition is a race on camels, but it's not who can get to the city first... it's whoever's camel is slower will be the victor. The two sons must figure out a way to decide that out, as each one wants to obtain the fortune.


Ahh ok, I didn't get the part about the slowest camel.

Now I don't understand the answer.
D3 and Pho, the way to go. http://www.teamliquid.net/forum/viewmessage.php?topic_id=340709
DarkPlasmaBall
Profile Blog Joined March 2010
United States45772 Posts
April 18 2012 18:04 GMT
#85
On April 19 2012 03:03 cmen15 wrote:
Show nested quote +
On April 19 2012 01:36 Geo.Rion wrote:
On April 18 2012 23:44 Ghanburighan wrote:
[image loading]

+ Show Spoiler [Hint] +
Count something


+ Show Spoiler [solution] +
Count the number of circles in the numbers, for example 8 has two.

damn, i arrived at the right conclusion,+ Show Spoiler +
2, but didnt notice it has anything to do with circles, i simply noticed the numbers have a "weight" most of them 0, so i went on and discovered 6, 9, 0 had a "weight" of one, and 8 has "2".

Wow... dude I like your way much better : )


That's cool Like a whole slew of linear equations, where each digit from 0-9 can be replaced with a variable ^^
"There is nothing more satisfying than looking at a crowd of people and helping them get what I love." ~Day[9] Daily #100
DarkPlasmaBall
Profile Blog Joined March 2010
United States45772 Posts
April 18 2012 18:06 GMT
#86
On April 19 2012 03:03 Krowser wrote:
Show nested quote +
On April 19 2012 02:55 DarkPlasmaBall wrote:
On April 19 2012 02:50 Krowser wrote:

Riddle 3:

An Arab sheikh tells his two sons to race their camels to a distant city to see who will inherit his fortune. The one whose camel is slower wins. After wandering aimlessly for days, the brothers ask a wise man for guidance. Upon receiving the advice, they jump on the camels and race to the city as fast as they can. What did the wise man say to them?

Solution:
+ Show Spoiler +
Switch camels


Is it just me or this riddle doesn't make sense. Something is up with the structure.

It's like saying:

A single mom has two kids, a boy and a girl. The mother always had a fancy for cake but she never wore blue coloured coveralls.

How old is the bus driver?


I don't see what the problem is, but maybe I can clarify: the sheikh has decided to give his fortune to exactly one of his two sons. Who he gives it to will be decided by a competition between the two boys. The competition is a race on camels, but it's not who can get to the city first... it's whoever's camel is slower will be the victor. The two sons must figure out a way to decide that out, as each one wants to obtain the fortune.


Ahh ok, I didn't get the part about the slowest camel.

Now I don't understand the answer.


+ Show Spoiler +
If we switch camels, then I'm on your camel and you're on mine.
If I force your camel to go its top speed and you force mine to go its top speed, and if I win the race, then my camel (the one you're riding on) is slower, meaning I win the fortune.
"There is nothing more satisfying than looking at a crowd of people and helping them get what I love." ~Day[9] Daily #100
LRObot
Profile Joined April 2011
United States153 Posts
April 18 2012 18:12 GMT
#87
On April 18 2012 23:02 kochanfe wrote:
You have a jug that holds five gallons, and a jug that holds three gallons. You have no other containers, and there are no markings on the jugs. You need to obtain exactly seven gallons of water from a faucet. How can you do it?

Second Problem: You need exactly four gallons. How do you do it?


+ Show Spoiler +
Time how long it takes to fill either jug. You now have your water flow rate with respect to time. Timing out 7 gallons is accurately achieved.
Never say die
Alpino
Profile Joined June 2011
Brazil4390 Posts
April 18 2012 18:17 GMT
#88
On April 19 2012 00:08 DarkPlasmaBall wrote:
Here's a riddle:

How do you know when someone cheats and looks online for the solution to a riddle?

+ Show Spoiler +
On April 18 2012 23:33 sc2system wrote:
you are presented with 2 doors. one has millions of dollars behind it and the other has a lion that will eat you behind it. there are 2 guards in front of the doors that know what is behind the doors. one of them always tells the truth and one of them always lies, but you don't know which is which. You can only ask one question. What do you ask?


Took me like 2 minutes.

Solution:
+ Show Spoiler +
You ask "What would your brother say if I asked him behind which door the million dollars are?".

You will get the door where the dragon is.






/thread and I don't care, you took what I wanted to say but made it fun, kudos.
20/11/2015 - never forget EE's Ember
Bahamuth
Profile Joined September 2011
134 Posts
Last Edited: 2012-04-18 19:08:56
April 18 2012 18:24 GMT
#89
Okay, I have a really good one. Credit goes to the xkcd forums. I'll post the answer tomorrow. The solution is extremely counterintuitive.

There are 200 people on an abandoned island. 100 have green eyes, 100 have blue eyes. The only thing these people can do, is look each other in the eyes. There is no other form of communication. Therefore, they have no way to know what the colour of their own eyes is.

Every night, a boat comes to the island. If you can tell the captain with certainty what colour eyes you have, you can leave the island.

On day 1, a message is given to all inhabitants on the island: "There is at least one person that has green eyes."

The question is: Who can leave the island, and after how long?

Important notes:
- They are all perfect logicians
- Everyone knows the eyecolour of every OTHER inhabitant at all times. The only thing they don't know, is their own eyecolour.
- This can be solved with pure logic, not by coming up with workarounds like reflection in the water or communication with the captain.
- The only possible eyecolours are green and blue.

Kimaker
Profile Blog Joined July 2009
United States2131 Posts
April 18 2012 18:28 GMT
#90
On April 19 2012 03:24 Bahamuth wrote:
Okay, I have a really good one. Credit goes to the xkcd forums. I'll post the answer tomorrow. The solution is extremely counterintuitive.

There are 200 people on an abandoned island. 100 have green eyes, 100 have blue eyes. The only thing these people can do, is look each other in the eyes. There is no other form of communication. Therefore, they have no way to know what the colour of their own eyes is.

Every night, a boat comes to the island. If you can tell the captain with certainty what colour eyes you have, you can leave the island.

On day 1, a message is given to all inhabitants on the island: "There is at least one person that has green eyes."

The question is: Who can leave the island, and after how long?

+ Show Spoiler +
No one. Ever. There is no other form of communication other than staring.

Or I guess the captain can, every night.
Entusman #54 (-_-) ||"Gold is for the Mistress-Silver for the Maid-Copper for the craftsman cunning in his trade. "Good!" said the Baron, sitting in his hall, But Iron — Cold Iron — is master of them all|| "Optimism is Cowardice."- Oswald Spengler
solidbebe
Profile Blog Joined November 2010
Netherlands4921 Posts
Last Edited: 2012-04-18 18:34:01
April 18 2012 18:28 GMT
#91
On April 19 2012 03:24 Bahamuth wrote:
Okay, I have a really good one. Credit goes to the xkcd forums. I'll post the answer tomorrow. The solution is extremely counterintuitive.

There are 200 people on an abandoned island. 100 have green eyes, 100 have blue eyes. The only thing these people can do, is look each other in the eyes. There is no other form of communication. Therefore, they have no way to know what the colour of their own eyes is.

Every night, a boat comes to the island. If you can tell the captain with certainty what colour eyes you have, you can leave the island.

On day 1, a message is given to all inhabitants on the island: "There is at least one person that has green eyes."

The question is: Who can leave the island, and after how long?


The 200 people don't know there are 200 people with green eyes and blue eyes divided equally?

edit1:Can people communicate with the captain other than stating the color of their eyes?

edit2: Are all the people near each other? Are they separated? Can every person meet the 199 other people?
That's the 2nd time in a week I've seen someone sig a quote from this GD and I have never witnessed a sig quote happen in my TL history ever before. -Najda
Bahamuth
Profile Joined September 2011
134 Posts
April 18 2012 18:32 GMT
#92
On April 19 2012 03:28 solidbebe wrote:


The 200 people don't know there are 200 people with green eyes and blue eyes divided equally?


No they don't. And no, the answer is not that no one ever leaves.
Phant
Profile Joined August 2010
United States737 Posts
Last Edited: 2012-04-18 18:49:10
April 18 2012 18:40 GMT
#93
+ Show Spoiler +
On an island, there has to be some form of water they can see their reflection in and know their own eye color.

edit: also, if you say your eye color is blue, just guessing, and the captain doesnt let you leave, then you know you have green eyes and can leave the next time.
whatwhatanut
Profile Joined December 2010
United States195 Posts
April 18 2012 18:41 GMT
#94
On April 19 2012 03:32 Bahamuth wrote:
Show nested quote +
On April 19 2012 03:28 solidbebe wrote:


The 200 people don't know there are 200 people with green eyes and blue eyes divided equally?


No they don't. And no, the answer is not that no one ever leaves.


+ Show Spoiler +
Pretty sure 100 people leave the island by just saying green. Because they have evidence that shows they could. And there is and will nvr be anymore certainty available to any of them. Poor blue eyes .
kuresuti
Profile Blog Joined December 2009
1393 Posts
April 18 2012 18:41 GMT
#95
On April 19 2012 03:24 Bahamuth wrote:
Okay, I have a really good one. Credit goes to the xkcd forums. I'll post the answer tomorrow. The solution is extremely counterintuitive.

There are 200 people on an abandoned island. 100 have green eyes, 100 have blue eyes. The only thing these people can do, is look each other in the eyes. There is no other form of communication. Therefore, they have no way to know what the colour of their own eyes is.

Every night, a boat comes to the island. If you can tell the captain with certainty what colour eyes you have, you can leave the island.

On day 1, a message is given to all inhabitants on the island: "There is at least one person that has green eyes."

The question is: Who can leave the island, and after how long?

Important note: They are all perfect logicians.


The original, or at least from where it became somewhat famous can be found here, it's more fleshed out (might be helpful considering the difficulty).
khanofmongols
Profile Joined January 2011
542 Posts
April 18 2012 18:43 GMT
#96
Hint: you can look at everyones eyes each day. Deduce in what situations people can leave given this.

+ Show Spoiler +
The first day everyone knows that if there was only one person with green eyes then they would leave.
Since nobody leaves they know that there are at least 2 people with green eyes.

Now the second day happens and everyone knows that if there are only 2 people with green eyes then they will leave since they will see only one other person with green eyes and will know that they can leave. Since they don't leave, now there must be three people with green eyes.

This process continues until the 100 green eyed people leave on the 100th night.
Alvin853
Profile Joined December 2011
Germany149 Posts
April 18 2012 18:44 GMT
#97
On April 19 2012 03:24 Bahamuth wrote:
Okay, I have a really good one. Credit goes to the xkcd forums. I'll post the answer tomorrow. The solution is extremely counterintuitive.

There are 200 people on an abandoned island. 100 have green eyes, 100 have blue eyes. The only thing these people can do, is look each other in the eyes. There is no other form of communication. Therefore, they have no way to know what the colour of their own eyes is.

Every night, a boat comes to the island. If you can tell the captain with certainty what colour eyes you have, you can leave the island.

On day 1, a message is given to all inhabitants on the island: "There is at least one person that has green eyes."

The question is: Who can leave the island, and after how long?

Important note: They are all perfect logicians.



+ Show Spoiler +
I think we're missing some information here, can everybody see every one elses eye color? if so, the message on day 1 is irrelevant, because everyone will see at least 99 people with green eyes.
Also whats the punishment for answering wrong? Everyone could just guess state "blue" as their eye color on day 1, and then "green" on day 2
whatwhatanut
Profile Joined December 2010
United States195 Posts
April 18 2012 18:46 GMT
#98
On April 19 2012 03:43 khanofmongols wrote:
Hint: you can look at everyones eyes each day. Deduce in what situations people can leave given this.

+ Show Spoiler +
The first day everyone knows that if there was only one person with green eyes then they would leave.
Since nobody leaves they know that there are at least 2 people with green eyes.

Now the second day happens and everyone knows that if there are only 2 people with green eyes then they will leave since they will see only one other person with green eyes and will know that they can leave. Since they don't leave, now there must be three people with green eyes.

This process continues until the 100 green eyed people leave on the 100th night.


I don't understand why it has to be that complicated. The blue-eyed people are screwed because they will nvr be able to know they have blue eyes so in a logical manner everyone would just say they have green eyes because they know its a possibility.

Now if there was a possibility of more information becoming available or something then sure no need to bother risking your chance to get off the island.

I think its possible that 100 people leave on 1 day and 100 are trapped forever since in this scenario they seem to be trapped regardless.
endy
Profile Blog Joined May 2009
Switzerland8970 Posts
April 18 2012 18:46 GMT
#99
On April 19 2012 03:24 Bahamuth wrote:
Okay, I have a really good one. Credit goes to the xkcd forums. I'll post the answer tomorrow. The solution is extremely counterintuitive.

There are 200 people on an abandoned island. 100 have green eyes, 100 have blue eyes. The only thing these people can do, is look each other in the eyes. There is no other form of communication. Therefore, they have no way to know what the colour of their own eyes is.

Every night, a boat comes to the island. If you can tell the captain with certainty what colour eyes you have, you can leave the island.

On day 1, a message is given to all inhabitants on the island: "There is at least one person that has green eyes."

The question is: Who can leave the island, and after how long?

Important note: They are all perfect logicians.


I thought this one led to a paradox ? Or at least there are two solutions and both are disputable.
ॐ
DarkPlasmaBall
Profile Blog Joined March 2010
United States45772 Posts
April 18 2012 18:49 GMT
#100
On April 19 2012 03:17 Alpino wrote:
Show nested quote +
On April 19 2012 00:08 DarkPlasmaBall wrote:
Here's a riddle:

How do you know when someone cheats and looks online for the solution to a riddle?

+ Show Spoiler +
On April 18 2012 23:33 sc2system wrote:
you are presented with 2 doors. one has millions of dollars behind it and the other has a lion that will eat you behind it. there are 2 guards in front of the doors that know what is behind the doors. one of them always tells the truth and one of them always lies, but you don't know which is which. You can only ask one question. What do you ask?


Took me like 2 minutes.

Solution:
+ Show Spoiler +
You ask "What would your brother say if I asked him behind which door the million dollars are?".

You will get the door where the dragon is.






/thread and I don't care, you took what I wanted to say but made it fun, kudos.


Haha thanks

On April 19 2012 03:41 kuresuti wrote:
Show nested quote +
On April 19 2012 03:24 Bahamuth wrote:
Okay, I have a really good one. Credit goes to the xkcd forums. I'll post the answer tomorrow. The solution is extremely counterintuitive.

There are 200 people on an abandoned island. 100 have green eyes, 100 have blue eyes. The only thing these people can do, is look each other in the eyes. There is no other form of communication. Therefore, they have no way to know what the colour of their own eyes is.

Every night, a boat comes to the island. If you can tell the captain with certainty what colour eyes you have, you can leave the island.

On day 1, a message is given to all inhabitants on the island: "There is at least one person that has green eyes."

The question is: Who can leave the island, and after how long?

Important note: They are all perfect logicians.


The original, or at least from where it became somewhat famous can be found here, it's more fleshed out (might be helpful considering the difficulty).


Yeah, that's how I heard it once before.

My math friends and I went back and forth with brain teasers until I was given this one, and we worked it out using a much simpler case (like 1 blue and 1 green first, then moving upwards).

Also, I think it's important to note that the inhabitants don't know how many people of each eye color there are. Otherwise, you could just line everyone up and count, and figure out which color you should be (as one color would be one short).
"There is nothing more satisfying than looking at a crowd of people and helping them get what I love." ~Day[9] Daily #100
Prev 1 2 3 4 5 6 7 36 37 38 Next All
Please log in or register to reply.
Live Events Refresh
Replay Cast
09:00
uThermal 2v2 Circuit S2 Apr
CranKy Ducklings48
LiquipediaDiscussion
[ Submit Event ]
Live Streams
Refresh
StarCraft: Brood War
Horang2 3234
firebathero 629
Zeus 357
Shine 288
PianO 199
Larva 170
ToSsGirL 148
Soma 125
Leta 125
EffOrt 113
[ Show more ]
Dewaltoss 98
Killer 77
Aegong 68
Hyuk 68
actioN 67
910 64
hero 63
Sharp 53
Backho 39
HiyA 37
Hm[arnc] 36
JulyZerg 24
NotJumperer 16
scan(afreeca) 14
NaDa 14
Dota 2
monkeys_forever299
XcaliburYe218
NeuroSwarm139
League of Legends
JimRising 479
Counter-Strike
edward185
Other Games
gofns10160
summit1g6913
C9.Mang0266
Sick253
crisheroes175
Organizations
Other Games
gamesdonequick760
Dota 2
PGL Dota 2 - Main Stream76
StarCraft 2
Blizzard YouTube
StarCraft: Brood War
BSLTrovo
[ Show 16 non-featured ]
StarCraft 2
• LUISG 28
• Adnapsc2 14
• CranKy Ducklings SOOP5
• AfreecaTV YouTube
• intothetv
• Kozan
• IndyKCrew
• LaughNgamezSOOP
• Migwel
• sooper7s
StarCraft: Brood War
• BSLYoutube
• STPLYoutube
• ZZZeroYoutube
League of Legends
• TFBlade1679
• Jankos1277
• Stunt503
Upcoming Events
RSL Revival
35m
Classic vs GgMaChine
Rogue vs Maru
WardiTV Invitational
1h 35m
Percival vs Shameless
ByuN vs YoungYakov
SC Evo League
4h 35m
IPSL
6h 35m
Ret vs Art_Of_Turtle
Radley vs TBD
BSL
9h 35m
Replay Cast
14h 35m
RSL Revival
1d
herO vs TriGGeR
NightMare vs Solar
uThermal 2v2 Circuit
1d 4h
BSL
1d 9h
IPSL
1d 9h
eOnzErG vs TBD
G5 vs Nesh
[ Show More ]
Patches Events
1d 14h
Replay Cast
1d 23h
Wardi Open
2 days
Afreeca Starleague
2 days
Jaedong vs Light
Monday Night Weeklies
2 days
Replay Cast
2 days
Sparkling Tuna Cup
3 days
Afreeca Starleague
3 days
Snow vs Flash
WardiTV Invitational
3 days
GSL
4 days
Classic vs Cure
Maru vs Rogue
GSL
5 days
SHIN vs Zoun
ByuN vs herO
OSC
5 days
Replay Cast
5 days
Escore
6 days
The PondCast
6 days
WardiTV Invitational
6 days
Replay Cast
6 days
Liquipedia Results

Completed

Escore Tournament S2: W5
WardiTV TLMC #16
Nations Cup 2026

Ongoing

BSL Season 22
ASL Season 21
CSL 2026 SPRING (S20)
IPSL Spring 2026
KCM Race Survival 2026 Season 2
KK 2v2 League Season 1
Acropolis #4
SCTL 2026 Spring
RSL Revival: Season 5
2026 GSL S1
BLAST Rivals Spring 2026
IEM Rio 2026
PGL Bucharest 2026
Stake Ranked Episode 1
BLAST Open Spring 2026
ESL Pro League S23 Finals
ESL Pro League S23 Stage 1&2
PGL Cluj-Napoca 2026

Upcoming

BSL 22 Non-Korean Championship
CSLAN 4
Kung Fu Cup 2026 Grand Finals
HSC XXIX
uThermal 2v2 2026 Main Event
Maestros of the Game 2
2026 GSL S2
Stake Ranked Episode 3
XSE Pro League 2026
IEM Cologne Major 2026
Stake Ranked Episode 2
CS Asia Championships 2026
IEM Atlanta 2026
Asian Champions League 2026
PGL Astana 2026
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 © 2026 TLnet. All Rights Reserved.