• Log InLog In
  • Register
Liquid`
Team Liquid Liquipedia
EDT 06:45
CEST 12:45
KST 19:45
  • 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
Classic wins Code S Season 2 (2025)16Code S RO4 & Finals Preview: herO, Rogue, Classic, GuMiho0TL Team Map Contest #5: Presented by Monster Energy6Code S RO8 Preview: herO, Zoun, Bunny, Classic7Code S RO8 Preview: Rogue, GuMiho, Solar, Maru3
Community News
Esports World Cup 2025 - Final Player Roster10Weekly Cups (June 16-22): Clem strikes back1Weekly Cups (June 9-15): herO doubles on GSL week4Firefly suspended by EWC, replaced by Lancer12Classic & herO RO8 Interviews: "I think it’s time to teach [Rogue] a lesson."2
StarCraft 2
General
Esports World Cup 2025 - Final Player Roster The SCII GOAT: A statistical Evaluation Classic wins Code S Season 2 (2025) Weekly Cups (June 16-22): Clem strikes back Nexon wins bid to develop StarCraft IP content, distribute Overwatch mobile game
Tourneys
EWC 2025 Online Qualifiers (May 28-June 1, June 21-22) Monday Nights Weeklies RSL: Revival, a new crowdfunded tournament series WardiTV Mondays Sparkling Tuna Cup - Weekly Open Tournament
Strategy
How did i lose this ZvP, whats the proper response Simple Questions Simple Answers [G] Darkgrid Layout
Custom Maps
[UMS] Zillion Zerglings
External Content
Mutation # 479 Worn Out Welcome Mutation # 478 Instant Karma Mutation # 477 Slow and Steady Mutation # 476 Charnel House
Brood War
General
BGH Auto Balance -> http://bghmmr.eu/ Soma Explains: JaeDong's Defense vs Bisu bonjwa.tv: my AI project that translates BW videos Pro gamer house photos StarCraft & BroodWar Campaign Speedrun Quest
Tourneys
[Megathread] Daily Proleagues [BSL20] ProLeague Bracket Stage - WB Finals & LBR3 [BSL20] ProLeague Bracket Stage - LB Round 4 & 5 [ASL19] Grand Finals
Strategy
I am doing this better than progamers do. Simple Questions, Simple Answers [G] How to get started on ladder as a new Z player
Other Games
General Games
Path of Exile Stormgate/Frost Giant Megathread Nintendo Switch Thread What do you want from future RTS games? Beyond All Reason
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
Things Aren’t Peaceful in Palestine Russo-Ukrainian War Thread Social coupon sites US Politics Mega-thread UK Politics Mega-thread
Fan Clubs
SKT1 Classic Fan Club! Maru Fan Club
Media & Entertainment
Anime Discussion Thread [Manga] One Piece [\m/] Heavy Metal Thread Korean Music Discussion
Sports
2024 - 2025 Football Thread TeamLiquid Health and Fitness Initiative For 2023 NHL Playoffs 2024 Formula 1 Discussion
World Cup 2022
Tech Support
Computer Build, Upgrade & Buying Resource Thread
TL Community
The Automated Ban List
Blogs
How Pro Gamers Cope with Str…
TrAiDoS
StarCraft improvement
iopq
Heero Yuy & the Tax…
KrillinFromwales
I was completely wrong ab…
jameswatts
Need Your Help/Advice
Glider
Trip to the Zoo
micronesia
Customize Sidebar...

Website Feedback

Closed Threads



Active: 33430 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 States44158 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 States44158 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 States44158 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 States44158 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
10:00
StarCraft Evolution League #14
CranKy Ducklings101
LiquipediaDiscussion
[ Submit Event ]
Live Streams
Refresh
StarCraft 2
Harstem 92
StarCraft: Brood War
Bisu 709
firebathero 530
Hyuk 464
Shuttle 372
Rush 354
BeSt 318
actioN 282
EffOrt 253
Zeus 237
Pusan 146
[ Show more ]
Hyun 109
Mini 100
ZerO 85
ToSsGirL 77
Shinee 53
Aegong 40
Mind 38
Light 33
sorry 31
Backho 19
Sharp 18
Sacsri 17
Movie 13
Nal_rA 10
soO 7
Barracks 6
Dota 2
BananaSlamJamma294
XcaliburYe225
Counter-Strike
Stewie2K3736
olofmeister1871
shoxiejesuss817
x6flipin76
Super Smash Bros
Mew2King207
Other Games
Happy327
DeMusliM285
crisheroes264
XaKoH 208
Fuzer 174
Pyrionflax75
ZerO(Twitch)16
Organizations
Dota 2
PGL Dota 2 - Main Stream13352
PGL Dota 2 - Secondary Stream8659
Other Games
gamesdonequick678
StarCraft 2
Blizzard YouTube
StarCraft: Brood War
BSLTrovo
sctven
[ Show 12 non-featured ]
StarCraft 2
• LUISG 32
• AfreecaTV YouTube
• intothetv
• Kozan
• IndyKCrew
• LaughNgamezSOOP
• Migwel
• sooper7s
StarCraft: Brood War
• BSLYoutube
• STPLYoutube
• ZZZeroYoutube
Other Games
• WagamamaTV103
Upcoming Events
PiGosaur Monday
13h 15m
Replay Cast
1d 13h
The PondCast
1d 23h
Replay Cast
2 days
HomeStory Cup
3 days
HomeStory Cup
4 days
BSL: ProLeague
4 days
SOOP
4 days
Sparkling Tuna Cup
4 days
HomeStory Cup
5 days
[ Show More ]
BSL: ProLeague
5 days
Replay Cast
6 days
Liquipedia Results

Completed

Rose Open S1
2025 GSL S2
Heroes 10 EU

Ongoing

JPL Season 2
BSL 2v2 Season 3
BSL Season 20
Acropolis #3
KCM Race Survival 2025 Season 2
CSL 17: 2025 SUMMER
Copa Latinoamericana 4
Championship of Russia 2025
RSL Revival: Season 1
Murky Cup #2
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
CCT Season 2 Global Finals
IEM Melbourne 2025
YaLLa Compass Qatar 2025
PGL Bucharest 2025

Upcoming

CSLPRO Last Chance 2025
CSLPRO Chat StarLAN 3
K-Championship
uThermal 2v2 Main Event
SEL Season 2 Championship
Esports World Cup 2025
HSC XXVII
BLAST Open Fall 2025
BLAST Open Fall Qual
Esports World Cup 2025
BLAST Bounty Fall 2025
BLAST Bounty Fall Qual
IEM Cologne 2025
FISSURE Playground #1
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.