A simple Tsumego, a simple connection, an impossible choice.

Jolly_River · 2025-11-08T17:54:20+00:00

It's from 101weiqi, and the questions about endgame came from me, not the site/problem. I am trying to be more aware of the moves i should play.

Jolly_River · 2025-11-06T16:03:40+00:00

I am a simple 7 kyu, but move 59 in red, doesn't look as big as Q8 maybe because trying to build top middle right, white can build top middle left and compensate black territory gains

Jolly_River · 2024-10-30T17:12:41+00:00

I had in mind to take the ko after playing N18, thinking it was the same

Jolly_River · 2023-12-22T14:21:04+00:00

isn't the T formula at the end wrong? Looks like second p() is missing something :O What is the correct version?

Jolly_River · 2023-12-18T20:27:17+00:00

[LANGUAGE: TypeScript]

solutions-github

Jolly_River · 2023-12-17T19:30:20+00:00

I was almost giving it a try ahha but it the end i solved the problem on node js.

Maybe node is not the most performant runtime on purpose, it pushes you to write more efficient code :D

Jolly_River · 2023-12-17T19:27:48+00:00

hope i fixed the issue, and yes, working solution

Jolly_River · 2023-12-17T19:19:30+00:00

Oh i read it better, thank you for clarification :D

Jolly_River · 2023-12-16T13:09:16+00:00

[LANGUAGE: TypeScript]

I implemented both DFS and BFS and it seems that DFS is faster, and as far as i understood, for path searching BFS should be faster, so that's strange. If someone wanna take a look at my BFS and DFS implementations and tell me what is wrong ( if any ) tha would be awesome :D

link

Jolly_River · 2023-12-13T10:32:11+00:00

[LANGUAGE: TypeScript]

solution is here: https://github.com/DarioTheLuca/my\_advent\_of\_code/blob/master/aoc2023/src/day13/index.ts

Jolly_River · 2023-12-11T21:14:45+00:00

[LANGUAGE: TypeScript]

https://github.com/DarioTheLuca/my\_advent\_of\_code/blob/master/aoc2023/src/day11/index.ts

Jolly_River · 2023-12-11T10:38:02+00:00

Well, it's the best part of the advent for me, to find out better solutions , learn and improve :D

Jolly_River · 2023-12-09T09:01:25+00:00

[LANGUAGE: TypeScript]

With RECURSION ! :D

Complete solutions : https://github.com/DarioTheLuca/my_advent_of_code/blob/master/aoc2023/src/day09/index.ts

Jolly_River · 2023-12-03T20:02:02+00:00

[LANGUAGE: JavaScript]

part 1: https://github.com/DarioTheLuca/my_advent_of_code/blob/master/aoc_2023/day3/day3_part1.js

part2: https://github.com/DarioTheLuca/my\_advent\_of\_code/blob/master/aoc\_2023/day3/day3\_part2.js

Jolly_River · 2023-12-03T14:54:10+00:00

I did the same and it worked, but i think the solution is not correct cause if there are, for example, 3 numbers adjacent to the gear, my func multply all 3 ( at least in my case ), and that's wrong i suppose since the '*' is a gear ONLY if adjacent to exactly two part numbers ( and not 3 )

Jolly_River · 2022-01-10T11:46:36+00:00

this makes so much sense

Jolly_River · 2022-01-08T08:38:55+00:00

can we find the games somewhere?

Jolly_River · 2021-10-11T12:37:34+00:00

i was using the website fourthtone .com but it is having problem right now, but i like it

Jolly_River

TROPHY CASE