jpages

Software engineer (C, Python, Java, Rust...). Privacy toxic maximalist and radical anti-statist. Shogi, go and chess player.

Public Key

npub1mr0wam5le7yta87mshdg2jrflgv9t0fq6gl4gkvaejw54k6z78gq9ek4s2

Profile Code

nprofile1qqsd3hhwa60ulz97nldctk59fp5l5xz4h5sdy065txwue822mdp0r5q44zzg2

Author Public Key

npub1mr0wam5le7yta87mshdg2jrflgv9t0fq6gl4gkvaejw54k6z78gq9ek4s2

Show more details

Last Notes

2024-02-06 15:08:34

- reply

I am delisting Binance.
Wait... I never used Binance, nor any other CEX.

2024-01-30 19:48:36

J'ai vécu ce genre de situation.
Même si je ne me suis pas laissé faire, j'aurais bien aimé être aussi badass que Stallone.
https://www.reddit.com/r/CoronavirusCirclejerk/comments/1ackrml/who_can_relate/

2024-01-22 23:48:45

Un bon rappel des nombreuses saloperies commises par les covidistes entre 2020 et 2022.
Ni oubli, ni pardon.
#covid
https://twitter.com/consent_factory/status/1238971734063226881

2024-01-03 18:04:50

Only 2% of Britons and 3% of Germans know that Ding Liren is the current Chess World Champion, according to a survey conducted in both countries.
More people thought the World Champion was still Magnus Carlsen, or even Garry Kasparov, who turned 60 last year.
#chess
https://en.chessbase.com/post/who-knows-his-name

2023-12-28 03:27:49

Advent of Code - Day 25
Part 1 : > 24 h (rank 10741)
Part 2 : > 24 h (rank 7862)
The final problem was much harder (for me) than expected, and I could not figure out a decent algorithm to solve it within 24 hours, even if I tried very hard.
I finally solved it a few hours ago, with a statistical method. I computed the shortest paths from 500 nodes, and I counted how many times edges were included in the paths. Then, I tested in priority the most represented edges.
#AdventOfCode

2023-12-25 03:00:41

Advent of Code - Day 24
Part 1 : 6:36:24 (Rank 6581)
Part 2 : 20:23:38 (Rank 6038)
This one was the most complex, and the most interesting.
In Part 1, I submitted a wrong answer and had to use BigInt to get the star. I also defined a class for rational numbers, in order to work with exact values.
In Part2, I used space geometry, with plane equations, intersections of planes and lines. I ended in finding the zero of a rational function with the help of a binary search algorithm.
#AdventOfCode

2023-12-23 22:55:59

Advent of Code - Day 23
Part 1 : 4h11:00 (rank 5271)
Part 2 : 16h02:15 (rank 7541)
I started late but got easily the first star with a "naive" algorithm.
For Part 2, I had to rewrite the code from scratch. I decided to build a graph from the labyrinth (where nodes are crossroads, start and end points). Then, I used a DFS algorithm.
I spent many hours trying to optimize the code, prune the paths tree and get a correct runtime (100 ms). Furthermore, my first answer was too high.
#AdventOfCode

2023-12-22 22:57:34

Advent of Code - Day 22
Part 1 : 04:03:29 (rank 4278)
Part 2 : 05:56:03 (rank 4518)
A very interesting simulation problem about the game of Jenga.
In Part 1, I was not sure which data structure was the most efficient and I spent too much time on this task (I changed the data structure twice !), but I ended with my best rank so far.
Part 2 was easier, as I only had to apply a BFS algorithm on the tree I had built earlier.
Part 1 runs in 55 ms and Part 2 in 70 ms.
#AdventOfCode

2023-12-21 18:37:17

Advent of Code - Day 21
Part 1 : 05h17:57 (rank 10217)
Part 2 : 10h27:42 (rank 4411)
I started very late, but I worked fast for Part 1 (maybe half an hour). I used a very classic BFS algorithm.
Part 2 was much harder, but I found the correct idea (find a cycle in the reachable cells growth sequence) faster than yesterday, and I got my best rank so far this year.
Part 1 runs in 20 ms, and Part 2 in 200 ms.
#AdventOfCode

2023-12-21 01:37:12

Advent of Code - Day 20
Part 1 : 5h50:58 (rank 7237)
Part 2 : 20h20:11 (rank 10948)
This was by a mile the most exhausting problem this year.
Part 1 was already tedious, but the worst was yet to come.
In order to solve the part 2, it was necessary to visualize the graph topology, but I didn't do that at first, and I tried an over complicated and non-functioning algorithm.
#AdventOfCode

2023-12-19 22:57:21

Advent of Code - Day 19
Part 1 : 2h20:00 (rank 6487)
Part 2 : 4h37:51 (rank 4737)
In Part 1, I struggled a bit with parsing and regular expressions.
In Part 2 , I saw immediately which method I had to use (this reminded me the Day 22 of Advent of Code 2021), but I had more difficulties with the implementation details. When I could compile the code, it worked on first try.
Part 1 runs in 3ms and Part 2 in 2 ms.
#AdventOfCode

2023-12-18 22:52:09

Advent of Code - Day 18
Part 1 : 4h09:59 (rank 8314)
Part 2 : 4h37:12 (rank 5002)
It's a shame I started two hours late this morning, as I coded amazingly well.
I used the Shoelace theorem for both parts, but without the Pick formula I discovered after the stars validation on Reddit.
The code runs in linear time (800 µs for each part).
For Part 2, all I needed to add was a new parser.
#AdventOfCode

2023-12-17 22:33:28

Advent of Code - Day 17
Part 1 : 7h45:45 (rank 7415)
Part 2 : 10h30:44 (rank 8213)
Today's problem was really tough, as I expected. This was the classic pathfinding problem.
I struggled and I spent way too much time on my Dijkstra algorithm implementation. My first working version was too slow (20 seconds for Part 1 !), and I had to reengineer it completely.
After the stars validations, I improved the performance. Part 1 now runs in 100 ms and Part 2 in 200 ms.
#AdventOfCode

2023-12-16 22:54:34

Advent of Code - Day 16
Part 1 : 1h33:20 (rank 5030)
Part 2 : 1h44:15 (rank 4656)
This problem was easier than expected.
For Part 1, I used a recursive algorithm for the beam simulation (whereas many people used BFS), with bitwise operations to accelerate the code. This part executes in 800 µs.
In Part 2, I simply repeated this process for every border tile (440 for the input data), and got my best ranking so far.
#AdventOfCode

2023-12-15 22:52:26

Advent of Code - Day 15
Part 1 : 1h02:01 (rank 8098)
Part 2 : 1h50:35 (rank 7297)
An easy and very instructive problem, that describes hashmaps internals.
Part 1 can be solved with a one-liner, thanks to the foldLeft() method.
In Part 2, I struggled a bit to understand in which box the lenses should be put in. I had not noticed the sentence "The result of running the HASH algorithm on the label indicates the correct box for that step".
#AdventOfCode

2023-12-14 22:52:35

Advent of Code - Day 14
Part 1 : 58:03 (rank 6724)
Part 2 : 4h57:17 (rank 9095)
Part 1 went quite smoothly.
However, even if I quickly understood which method I had to use in Part 2, I made a lot a silly mistakes and thought that the period to find was very long (several thousands or millions of steps), whereas in my case it was equal to 34. I even submitted a wrong answer for my first attempt, because of a bug in a simulation function.
#AdventOfCode

2023-12-13 22:55:19

Advent of Code - Day 13
Part 1 : 2h09:00 (rank 7479)
Part 2 : 3h52:45 (rank 7945)
I started one hour late, but I was in good shape this morning, and I could write concise (70 lines) and fast code (about 3 ms for each part).
The problem was obviously easier than yesterday's problem. When I saw part 2, I understood that I had to find a clever idea, and that I could not just encapsulate my part 1 code in a loop.
#AdventOfCode

2023-12-12 22:54:19

Advent of Code - Day 12
Part 1 : 3h56:00 (rank 10562)
Part 2 : 10h46:51 (rank 8638)
So far, this was the hardest day, by a mile.
I spent a long time in solving this problem, but I finally ended with a clear and concise code (about 80 lines).
Like most of the participants who solved the problem, I used a recursive search function with memoization. The code (in Scala) runs in about 600 ms for both parts combined.
I submitted a wrong answer again at my first attempt for Part 1.
#AdventOfCode

2023-12-11 22:56:11

Advent of Code - Day 11
Part 1 : 55:10 (rank 6631)
Part 2 : 1h10:47 (rank 6001)
Today, I used the correct data structure (a buffer, each element representing a galaxy coordinates) from the beginning.
That made Part 2 easy, as I only needed to introduce an additional integer parameter for the universe expansion factor.
However, I submitted a wrong answer at my first attempt for Part 2. I forgot to convert distances to 64-bit integers, and this provoked an integer overflow bug.
#AdventOfCode

2023-12-10 22:56:19

Advent of Code 2023 - Day 10
Part 1 : 1h40:19 (rank 6825)
Part 2 : 4h59:06 (rank 6548)
When I read the puzzle title ("Pipe Maze"), I already understood that this wouldn't be a walk in the park.
In part 1, the greatest difficulty lied in the handling of the starting position (i.e which pipe type is it ?).
Part 2 was really difficult. My first answer was off by 6, as I forgot an edge case. After the validation, I spent an additional hour to simplify the code.

2023-12-09 17:00:19

Advent of Code - Day 9
Part 1 : 1h23:32 (rank 10163)
Part 2 : 1h34:54 (rank 10068)
Today's problem was really easy, it is just a shame I started one hour late.
I expect a much harder puzzle tomorrow.
#AdventOfCode

2023-12-08 22:56:05

Advent of Code 2023 - Day 8
Part 1 : 30:25 (rank 8044)
Part 2 : 1:07:03 (rank 5350)
In part 1, the greatest difficulty lied in parsing and in the proper regular expression definition.
Then came part 2, where I quickly understood that brute force wasn't a serious option. I remembered AoC 2019 day 12, and I used the a similar method (with Lowest Common Multiple).

2023-12-07 17:56:24

Advent of Code 2023 - Day 7
Part 1 : 5h16:30 (rank 23536)
Part 2 : 5h52:59 (rank 19668)
I started very late, and I needed more than 2 hours to solve the part 1. I even submitted a wrong answer (the first time this year) as I had not seen that the rules for sorting hands were different from regular poker rules.
On the contrary, part 2 was quite easy. I took additional time to refactor the code, and improve its performances, reducing the runtime from 200 ms to 70 ms.
#AdventOfCode

2023-12-06 22:42:17

Advent of Code 2023 - Day 6
Part 1 : 19:09 (rank 6440)
Part 2 : 48:56 (rank 10227)
An easy problem for both parts. I solved the part 1 with a naive algorithm, then I changed it to solve a quadratic equation for part 2.
#AdventOfCode

2023-12-05 23:37:55

Wikipedia a enregistré un gros pic de visites sur l'article "Scratchcard" (jeu à gratter en anglais) à cause du jour 4 de l'Advent of Code.
Cela n'est pas sans rappeler le pic enregistré par Google le 13 décembre 2020 sur la requête "Chinese remainder theorem" pour la même raison.
https://www.reddit.com/r/adventofcode/comments/18bchyb/2023_day_4_the_effect_of_aoc_linking_to/
#AdventOfCode

2023-12-05 22:59:33

Advent of Code - Day 5
Part 1 : 1:19:52 (rank 9976)
Part 2 : 5:07:13 (rank 10601)
This was an interesting problem.
Part 2 was really difficult. I used recursion (for the first time this year) and had to compute ranges intersections to solve it in a skillful day.
#AdventOfCode

2023-12-04 22:51:12

Advent of Code - Day 4
Part 1 : 4 : 53 : 37 (rank 37759)
Part 2 : 5 : 10 : 19 (rank 29080)
Today, I woke up late, that explains my bad ranking.
I actually spent about half an hour for part 1, and 17 minutes for part 2. The only actual difficulty was in parsing, with the split() function.
#AdventOfCode

2023-12-03 22:48:05

Advent of Code 2023 - Day 3
Part 1 : 1:02:42 (rank 7159)
Part 2 : 2:28:41 (rank 10439)
Today's problem was harder, as it required 2-dimensional grid manipulations.
The first version of my code, that I used for the puzzle validation was a mess. I almost entirely reengineered it after the validation.
#AdventOfCode

2023-12-02 15:57:04

Advent of Code 2023 - Day 2
Part 1 : 41:31 (rank 9040)
Part 2 : 46:33 (rank 8206)
I woke up a few moments before 6 am and had to run to my computer to start on time.
Today, the problem difficulty mainly came from parsing and splitting strings. The calculation part was really easy, as expected for Day 2.
#AdventOfCode

2023-12-01 13:46:38

Advent of Code 2023 - Day 1
Part 1 : 10:42 (rank 5315)
Part 2 : 41:09 (rank 4708)
This first problem involved string manipulations.
I set a new overall rapidity record in part 1. Then, I avoided the part 2 traps, thanks to Test-Driven Development.
The proportion of participants who didn't succeed in part 2 really surprises me.
#AdventofCode

2023-11-19 18:41:17

Today, I solved the terrifying Day 19 of #AdventOfCode 2015, spending "only" 5 hours for part 2. 😀

2023-11-06 17:45:20

Quand Albert Einstein et Hannah Arendt lançaient un avertissement à propos des tendances fascisantes de Menahem Begin, dans une lettre au New York Times en 1948 :
https://www.marxists.org/reference/archive/einstein/1948/12/02.htm

2023-11-06 15:01:21

Santosh Vidit et Hikaru Nakamura se sont qualifiés hier pour le tournoi des Candidats en terminant aux 2 premières places du Grand Suisse.
Classement complet : https://chess-results.com/tnr793016.aspx?lan=1&art=2&rd=11&turdet=YES&flag=30
#echecs

2023-10-29 21:21:42

La France, condamnant fermement les attaques de colons en Cisjordanie :
https://www.youtube.com/watch?v=0UXtvwwzU6w

2023-10-29 13:49:26

Il y a 40 ans, presque jour pour jour, le gros coup de gueule de Daniel Balavoine à propos de la situation au Proche-Orient :
https://www.youtube.com/watch?v=d0--opdqpA8

2023-10-28 12:59:37

L'infâme Macron, par son "soutien inconditionnel" au boucher Netanyahou, se fait le complice d'un génocide.
Ce bandit doit être impérativement chassé du pouvoir, par la force si nécessaire, comme l'ont fait les Ukrainiens à Maidan.

2023-10-28 03:05:19

En toute logique, si la FIDE interdit aux joueurs russes et biélorusses d'arborer leur drapeau national lors des tournois, elle devrait également appliquer cette sanction aux joueurs azéris et israéliens.

2023-10-25 22:22:51

Yesterday, I advanced to level 5 (125 problems solved) on the Project Euler.
I am now trying to solve my first 60% problem (the problem 222).
#projecteuler

2023-10-23 10:42:48

Le chiffrement, ça marche.
https://nitter.unixfox.eu/OpexNews/status/1716360871998320779

2023-10-11 11:38:07

Edward Snowden a plutôt bien résumé la situation au Proche-Orient.
J'ajouterais que je suis également très inquiet pour l'avenir de la France, qui, comme Israël, est en état de fascisation avancée. Même si je n'ai aucun sentiment patriotique, j'ai vraiment honte de la position prise par la France dans ce conflit.
http://nitter.unixfox.eu/Snowden/status/1710765641534246929#m

2023-10-04 23:24:13

Les gens qui répètent sans réfléchir "nul n'est anonyme sur Internet", je suis certain qu'ils savent qui est Satoshi Nakamoto.

2023-10-04 09:32:51

Parmi les 28 abrutis ayant signé cet amendement absurde se trouve le député de ma circonscription (Frédéric Valletoux, qui a déjà montré sa bêtise crasse durant le cirque du covid).
Heureusement, je n'ai pas voté aux dernières élections, et, comme aurait dit George Carlin, je ne suis pas responsable de ce merdier.
https://www.assemblee-nationale.fr/dyn/16/amendements/1674/AN/915

2023-09-21 12:48:43

Après avoir juré que le SNU ne serait jamais obligatoire, la Macronie veut le rendre obligatoire.
Ayant bien vu ce qui s'est passé avec l'infâme pass sanitaire, je ne suis pas le moins du monde étonné.

2023-09-21 10:08:35

Une sérieuse attaque contre la liberté de la presse en France.
Visiblement, les bandits qui dirigent la France n'aiment pas que leurs crimes soient exposés publiquement.
https://nitter.unixfox.eu/Disclose_ngo/status/1704578279657632166#m

2023-09-16 22:23:08

- reply

Chiale plus fort, Mounir Belhamiti, on continuera à utiliser des VPN, que ça te plaise ou pas.
https://nitter.unixfox.eu/LInforme_/status/1702716151216714208#m

2023-09-16 17:01:39

I have just advanced to Level 4 (100 problems solved) on the Project Euler.
Next goal : enter the top 1% (currently at 114 problems solved).
#projecteuler

2023-09-16 13:08:28

Bon courage pour essayer d'appliquer ça sur Nostr, bande d'abrutis !
https://www.reddit.com/r/france/comments/16jjgzo/15_septembre_des_d%C3%A9put%C3%A9s_renaissance_ont_d%C3%A9pos%C3%A9/

2023-09-08 18:26:23

Moi quand je vois une réponse de ChatGPT à une question de mathématiques :
https://www.youtube.com/watch?v=HFPfbEa0UO8&t=10s

2023-08-31 21:47:31

Let's remind some basic principles.
https://www.eff.org/deeplinks/2023/08/isps-should-not-police-online-speech-no-matter-how-awful-it

2023-08-30 13:30:27

Last month, I played the WOSC (World Open Shogi Championship) in Strasbourg.
I failed in the Team tournament, by losing my three games, but I bounced back in the Main tournament and won 5 games out of 9, with 2 victories against 1-dan players.
Results and some pictures here : https://esc2023.shogi.fr/
#shogi

2023-08-27 20:37:45

Mitra Hejazipour, expelled from the Iranian national chess team in 2020 for removing her hijab during a tournament in Moscow, won the Women's French championship today.
Yannick Gozzoli won the Open section title.
#chess

2023-08-19 18:45:07

ChatGPT is not even able to check if a number can be divided by 3 accurately. This is the kind of basic operation I was able to do at the age of 9.
Is it really supposed to replace software engineers ?
https://www.reddit.com/r/ChatGPT/comments/15uttkq/chatgpt_fails_at_finding_prime_numbers/

2023-07-09 19:08:43

I have just won my first Swiss tournament on #lichess.
https://lichess.org/swiss/KAIkToqj
#chess

2023-07-07 00:33:08

- reply

Too bad my smartphone camera is masked 99.9 % of the time, and the microphone is dead (a Fairphone 2 endemic illness).
Anyway, the 80 enemies of freedom who voted for deserve a harsh punishment.

2023-07-05 19:28:06

No. Next question ?
https://www.bbc.com/news/technology-66099040

2023-07-05 10:17:58

Macron, si tu essaies de couper les réseaux sociaux, on viendra aussi te couper quelque chose.
#revolution #14juillet

2023-07-05 09:53:01

- reply

It seems that Threads is illegal in the EU, as it does not abide with the GDPR.
https://www.independent.ie/business/technology/no-instagram-threads-app-in-the-eu-irish-dpc-says-metas-new-twitter-rival-wont-be-launched-here/a1927220337.html

2023-07-04 22:11:22

Je l'avoue, si je me suis radicalisé et si j'ai viré anarchiste, ce n'est pas à cause des abus permanents de l'Etat français depuis 2015, mais à cause de mes nombreuses heures de jeu sur Battle for Wesnoth et Supertuxkart.

2023-07-04 12:03:33

Why Fediverse instances should not federate with Threads.
https://ploum.net/2023-06-23-how-to-kill-decentralised-networks.html

2023-07-03 12:36:36

Gofundme n'a pas retiré la cagnotte en faveur du flic assassin malgré de nombreux signalements et en contradiction avec leurs CGU, alors qu'ils l'avaient fait (de manière scandaleuse) contre le convoi de la liberté au Canada.
Encore une plateforme à boycotter, plus que jamais.

2023-07-02 19:40:32

Ferme bien ta gueule Fabien Roussel, social-traître et ennemi de la liberté.
https://contre-attaque.net/2023/07/02/le-gouvernement-a-lassaut-dinternet-et-des-reseaux-sociaux/

2023-07-02 15:15:02

Entre mars 2020 et mai 2022, j'ai joyeusement et systématiquement bafoué les oukases "sanitaires" français (confinement, masque et couvre-feu). Cela m'a permis, à trois reprises, de constater l'état de fascisation avancée de la police française, prête à exécuter les ordres les plus absurdes.
Donc, ce qui s'est passé à Nanterre ne m'étonne pas. Je me dis que j'aurais pu être à la place du jeune assassiné si j'étais moins blanc. Pour le simple fait d'avoir voulu prendre l'air le soir, ou pour être monté sans masque dans un train.

2023-06-26 10:45:08

Les événements de la semaine passée en France, concernant les militants écologistes et l'association Anticor, nous démontrent la nécessité de renverser cette pseudo-République.

2023-06-25 11:29:16

Yesterday, my Lichess blitz rating finally reached 2000 points.
#chess

2023-06-15 18:58:38

Frontex is not a European agency but a ruthless criminal organization.

2023-06-14 12:03:47

- reply

It's time to use alternative app stores, like F-Droid for Android, and to give the middle finger to Apple and Google.

2023-06-14 11:55:50

- reply

Same bullshit on the Tour de France next month.
Riders often use experimental and harmful drugs (RIP Tom Simpson), run at 80 km/h or more in descents (RIP Fabio Casartelli), but they're afraid of a mild virus. 🤦

2023-06-13 11:30:25

- reply

A bunch of "if-else" statements can't be sentient.

2023-06-13 10:11:05

Cette année encore, je boycotterai le Tour de France, en raison de son "protocole sanitaire" délirant.
Le coureurs se dopent pour la plupart avec des produits en phase de test et descendent les cols à 80 km/h, mais oH lA lA lE cOvId c'EsT dAnGeReuX qUaNd mÊmE.
https://www.europe1.fr/sport/port-du-masque-distanciation-sociale-retour-dun-protocole-anti-covid-au-tour-de-france-4186864

2023-06-12 20:49:39

Révélateur de l'ignorance du Français moyen en matière de chiffrement (et certains commentaires sont à mourir de rire).
Non, si le téléphone en question est chiffré, avec une bonne phrase de passe, les enquêteurs ne pourront pas faire grand-chose, hormis tenter d'exploiter une hypothétique faille de sécurité. Et c'est très bien comme ça, la protection de la vie privée doit primer sur tout le reste.
https://nitter.lacontrevoie.fr/BFMTV/status/1668280134938382341

2023-06-06 12:12:56

- reply

Il ne sont même pas fichus d'écrire le mot "Tor" correctement, ils confondent Tails et LUKS et le mot "chiffrement" ne semble pas faire partie de leur vocabulaire (que j'imagine assez limité). Ca en dit très long sur leur bêtise crasse.

2023-06-06 12:01:53

Soutien total aux militants écologistes confrontés au terrorisme d'Etat.
https://reporterre.net/En-France-une-vague-d-arrestations-contre-le-mouvement-ecologiste-radical

2023-06-04 15:35:26

Thursday, Sota Fujii won the Meijin title against Akira Watanabe with 4 victories to 1.
He is the youngest player to win the Meijin and to own 7 major titles, at the age of 20.
#shogi

2023-06-01 10:38:13

- reply

Another good reason to leave the EU.

2023-05-28 21:37:06

Some people on this network fear the potential nefarious effects of quantum computers on Bitcoin.
However, I think they miss an important question : are useful quantum computers even feasible ? Some scientists, like Gil Kalai and Mikhail Dyakonov, think otherwise.
https://spectrum.ieee.org/the-case-against-quantum-computing

2023-05-28 17:00:17

Wikihow : "We spot and counter fake information"
Also Wikihow : "How to Attract a Taurus Man as a Scorpio Woman"

2023-05-27 13:43:57

Soutien à Florence Mendez, comédienne virée par M6 pour avoir traité publiquement l'infâme Darmanin de violeur.
Il faut le proclamer publiquement, Darmanin est bien un sale violeur.
https://www.reddit.com/r/france/comments/13qkk4j/lhumoriste_florence_mendez_%C3%A9cart%C3%A9e_de_teva_apr%C3%A8s/

2023-05-26 13:22:09

Le changement dans la continuité.
https://www.francetvinfo.fr/replay-radio/le-monde-est-a-nous/autriche-la-maison-d-hitler-enfin-transformee-en-centre-de-formation-pour-policiers_5820167.html

2023-05-25 13:11:47

- reply

Pour avoir vécu à Nantes 3 ans, et subi une canicule en juin 2005, je suis horrifié par la bêtise des "élus" nantais.
Ils ne sont même pas capables de comprendre qu'une grande place sans arbres est une fournaise en été.

2023-05-25 12:56:50

Humiliation publique bien méritée pour la social-traître Joanna Rolland.
https://contre-attaque.net/2023/05/14/nantes-inauguration-de-la-place-du-commerce-aux-arbres-citoyen/

2023-05-25 11:16:16

Some Spanish morons imagine they can outlaw end-to-end encryption.
They can go hug a cactus in hell. We'll keep using strong encryption, whether they like it or not.
https://www.wired.com/story/europe-break-encryption-leaked-document-csa-law/

2023-05-01 16:30:14

- reply

I rooted for Nepomniachtchi. 😅

2023-05-01 12:38:07

- reply

The match ended Saturday in a tie (7-7) after a victory for Ding in game 12 and two draws in the last games.
In the tiebreaks, played yesterday, the first three games were drawn, and Ding won the fourth and final game.
Ding Liren is the new World Chess Champion.
#chess #wcc2023

2023-04-26 10:35:51

The stupid French government wants to enact a social network ban against "online hate".
Good luck trying to enforce this crap on Nostr, idiots !
https://www.bfmtv.com/tech/contre-la-haine-en-ligne-le-gouvernement-envisage-une-interdiction-de-reseaux-sociaux_AV-202304260188.html

2023-04-26 10:31:07

- reply

Game 11 : Draw in 39 moves.
This game was played, again, with the Ruy Lopez. Nepomniatchi got an advantage after the strange 15...c4 played by Ding. However, he chose to enter in a series of exchanges with 19.dxc4, and went in a drawn Rook endgame.
#chess #wcc2023

2023-04-24 09:02:42

- reply

Game 10 : Draw in 45 moves.
Ding had a slight advantage in this game, played with the English Opening, but Nepomniachtchi defended very accurately, and the game ended with bare Kings.
#chess #wcc2023

2023-04-23 10:01:11

- reply

Game 9 : Draw in 82 moves.
This is the longest game so far. Ding offered an exchange sacrifice in order to gain connected passed pawns on the a and b files with 26...Be6, but Nepomniachtchi chose a safer option with 27.Bxe6. The game went into a Rook and Knight endgame with an extra pawn for Nepomniachtchi. Ding defended this endgame very precisely and obtained the draw.
#chess #wcc2023.

2023-04-21 09:04:45

- reply

Game 8 : Draw in 45 moves.
On a Nimzo-Indian Defense, Ding launched a strong attack on the h-file, and provoked Nepomniachtchi into playing a blunder (22...Bxe4 ?). Ten moves later, Nepomniachtchi played a bluff move (31...Qxh4) but Ding could not refute it and lost his advantage. The game ended in a drawn Rook endgame.
#chess #wcc2023

2023-04-20 09:33:11

- reply

Game 7 : Nepomniachtchi won with White in 37 moves.
Ding surprised everybody by playing the French Defense, suggested by his second Richard Rapport. Then, he defended well but ran low on time. On move 32, he had less than one minute left, and blundered a pawn, giving a decisive advantage to Nepomniachtchi. Ding resigned four moves later, with only 3 seconds left.
Halfway through the match, Nepomniachtchi leads 4 - 3.
#chess #wcc2023

2023-04-18 13:41:52

- reply

For people who don't understand French, there is a joint press release by Editions La Fabrique and Verso Books, that explains what happened.
https://www.versobooks.com/en-gb/blogs/news/joint-press-release-by-editions-la-fabrique-paris-and-verso-books-london

2023-04-18 11:48:05

Une autre violation très grave des libertés publiques.
Voilà à quoi servent les soi-disant "lois antiterroristes" : elles servent les terroristes les plus dangereux, qui sont les Etats.
https://revolutionpermanente.fr/Un-editeur-de-La-Fabrique-interpelle-a-Londres-pour-avoir-manifeste-en-France-solidarite

2023-04-18 09:56:30

- reply

Game 6 : Ding won with White in 44 moves.
Ding played the rather unusual London system (1.d4 Nf6 2.Nf3 d5 3.Bf4) and gained a slight edge at the end of the opening. Nepomniachtchi could not defend precisely, and Ding increased gradually his advantage. The game ended with a beautiful mating net.
#chess #wcc2023

2023-04-17 21:00:00

Un nouvel exemple de la dérive kafkaienne de la "République" française.
https://www.politis.fr/articles/2023/04/un-manifestant-puni-pour-refus-de-donner-le-code-dun-telephone-inexistant/

2023-04-16 08:59:52

- reply

Game 5 : Nepomniachtchi won with White in 48 moves.
Nepomniachtchi played a preparation on a Closed Spanish and gained an important clock advantage. Then, he launched a decisive kingside attack with 37.g5 and 38.Rg4.
#chess #wcc2023

2023-04-15 12:03:07

Ce porc fasciste de Darmanin a cru qu'il pouvait s'attaquer impunément à la Ligue des Droits de l'Homme.
Mal lui en a pris, parce que cette dernière connait depuis un nombre important de dons et d'adhésions (ce bon vieil effet Streisand). Et ce n'est pas fini, parce que je vais leur faire un don assez substantiel aujourd'hui (autour de 200 €, équivalent à 650000 sats).

2023-04-14 20:00:25

Even a self-driving cars pioneer says this is a pipe dream
https://futurism.com/self-driving-industry-going-nowhere

2023-04-14 19:57:29

- reply

Game 4 : Ding won with White in 47 moves.
Ding put pressure on Nepomniachtchi with his advanced central pawns. A rook for knight sacrifice gave him a decisive advantage he converted 20 moves later.
#chess #wcc2023

2023-04-13 09:13:35

- reply

Game 3 : Draw in 30 moves.
Ding Liren played a good game this time, and was never in danger of losing.
The game ended in a threefold repetition.
#chess #wcc2023

2023-04-12 08:54:15

- reply

Game 2 : Nepomniachtchi won with Black in 29 moves.
Ding Liren played a novelty early in the game (4. h3 !?). After the 12.Nxf6 mistake, things went downhill for Ding and Nepomniachtchi got easily his first win in a World Championship match.
#chess #wcc2023

2023-04-10 09:45:15

- reply

Game 1 : Draw in 49 moves.
Nepomniachtchi, with the white pieces, dominated the game after 24...c5 and 25...c6, but he could not convert his advantage into a win. The game ended in a drawn minor pieces endgame.
#chess #wcc2023