<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/">
    <channel>
        <title>Hello!</title>
        <link>http://www.yyin9116.eu.org/</link>
        <description>SEIZE THE DAY.</description>
        <lastBuildDate>Sun, 24 May 2026 04:23:27 GMT</lastBuildDate>
        <docs>https://validator.w3.org/feed/docs/rss2.html</docs>
        <generator>https://github.com/jpmonette/feed</generator>
        <language>en-US</language>
        <copyright>All rights reserved 2026, Yin:D</copyright>
        <item>
            <title><![CDATA[致花开前的你]]></title>
            <link>http://www.yyin9116.eu.org/article/2018d58b-e5e0-8080-9403-ef61faaa06eb</link>
            <guid>http://www.yyin9116.eu.org/article/2018d58b-e5e0-8080-9403-ef61faaa06eb</guid>
            <pubDate>Wed, 28 May 2025 00:00:00 GMT</pubDate>
            <description><![CDATA[不必忧伤不必怀念]]></description>
            <content:encoded><![CDATA[<div id="notion-article" class="mx-auto overflow-hidden "><main class="notion light-mode notion-page notion-block-2018d58be5e080809403ef61faaa06eb"><div class="notion-viewport"></div><div class="notion-collection-page-properties"></div><div class="notion-text notion-block-2018d58be5e080bb88d1e0e1c369383a"><b>致花开前的你</b></div><div class="notion-blank notion-block-2018d58be5e080e9b831cf5bc2a0cedd"> </div><div class="notion-text notion-block-2018d58be5e080a488e0ef057b5f93ca">我无比期待重逢时的欢喜</div><div class="notion-text notion-block-2018d58be5e080a2879bda01c0cb7f31">却对离别避之不及</div><div class="notion-blank notion-block-2018d58be5e08085ae56dca680d45510"> </div><div class="notion-text notion-block-2018d58be5e0804ebe7af601afeaa141">总有笑声</div><div class="notion-text notion-block-2018d58be5e08034a055f26c75c48d65">总有歌声</div><div class="notion-text notion-block-2018d58be5e080e8bb86e678623448af">总有眼泪未被照耀</div><div class="notion-text notion-block-2018d58be5e080b7ad34e30d2aa34c3f">总有企盼的目光低垂</div><div class="notion-blank notion-block-2018d58be5e080369e7adf91d59961e7"> </div><div class="notion-text notion-block-2018d58be5e080ebafc7e728692655fe">总有苦难</div><div class="notion-text notion-block-2018d58be5e080deb4f6d1216dfa0d60">总有遗憾</div><div class="notion-text notion-block-2018d58be5e08043a6bbc86ca74ac2e1">总有光亮脱影而出</div><div class="notion-text notion-block-2018d58be5e08006bb0ed82bbd7aadac">总有不舍的人们高歌</div><div class="notion-blank notion-block-2018d58be5e08094be37c303aba831e1"> </div><div class="notion-text notion-block-2018d58be5e08009904ec3a5a57f2183">再见，再见！</div><div class="notion-blank notion-block-2018d58be5e080358000e11d80316b42"> </div><div class="notion-text notion-block-2018d58be5e080d3a4c9dd2b93412234">我脚下的路</div><div class="notion-text notion-block-2018d58be5e080bfb1aee42986e0ab0d">也是你走过的</div><div class="notion-blank notion-block-2018d58be5e0800f8573cbbe18b041c4"> </div><div class="notion-text notion-block-2018d58be5e08022824fed204a91245f">我们已经重逢。</div></main></div>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[我们的游记]]></title>
            <link>http://www.yyin9116.eu.org/article/youji</link>
            <guid>http://www.yyin9116.eu.org/article/youji</guid>
            <pubDate>Tue, 27 May 2025 00:00:00 GMT</pubDate>
            <description><![CDATA[热情与感动在我们胸膛中燃烧]]></description>
            <content:encoded><![CDATA[热情与感动在我们胸膛中燃烧]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[智能博弈]]></title>
            <link>http://www.yyin9116.eu.org/article/1e28d58b-e5e0-802c-9996-e1163e3edcb8</link>
            <guid>http://www.yyin9116.eu.org/article/1e28d58b-e5e0-802c-9996-e1163e3edcb8</guid>
            <pubDate>Sun, 27 Apr 2025 00:00:00 GMT</pubDate>
            <description><![CDATA[调研内容与局部设计]]></description>
            <content:encoded><![CDATA[<div id="notion-article" class="mx-auto overflow-hidden "><main class="notion light-mode notion-page notion-block-1e28d58be5e0802c9996e1163e3edcb8"><div class="notion-viewport"></div><div class="notion-collection-page-properties"></div><div class="notion-blank notion-block-1e28d58be5e0801ab0bdefa391b6b6e9"> </div><h3 class="notion-h notion-h2 notion-h-indent-0 notion-block-1e28d58be5e08090b7a0d6a3fe8c5f02" data-id="1e28d58be5e08090b7a0d6a3fe8c5f02"><span><div id="1e28d58be5e08090b7a0d6a3fe8c5f02" class="notion-header-anchor"></div><a class="notion-hash-link" href="#1e28d58be5e08090b7a0d6a3fe8c5f02" title="调研内容"><svg viewBox="0 0 16 16" width="16" height="16"><path fill-rule="evenodd" d="M7.775 3.275a.75.75 0 001.06 1.06l1.25-1.25a2 2 0 112.83 2.83l-2.5 2.5a2 2 0 01-2.83 0 .75.75 0 00-1.06 1.06 3.5 3.5 0 004.95 0l2.5-2.5a3.5 3.5 0 00-4.95-4.95l-1.25 1.25zm-4.69 9.64a2 2 0 010-2.83l2.5-2.5a2 2 0 012.83 0 .75.75 0 001.06-1.06 3.5 3.5 0 00-4.95 0l-2.5 2.5a3.5 3.5 0 004.95 4.95l1.25-1.25a.75.75 0 00-1.06-1.06l-1.25 1.25a2 2 0 01-2.83 0z"></path></svg></a><span class="notion-h-title">调研内容</span></span></h3><ol start="1" class="notion-list notion-list-numbered notion-block-1e28d58be5e080769788d3a6949747e5" style="list-style-type:decimal"><li><b>alpha-beta</b> 剪枝和 <b>Min-Max</b> 搜索：</li></ol><div class="notion-row"><a class="notion-bookmark notion-block-1e28d58be5e080238e65e68bad8a75a5" href="https://wuli.wiki/changed/mmsab.html" target="_blank" rel="noopener noreferrer"><div><div class="notion-bookmark-title">Minimax 搜索和 Alpha-Beta 剪枝 - 小时百科</div><div class="notion-bookmark-description">本文中，使用孩子节点表示在树中、深度仅更深一层，并且与其直接相邻的节点（也就是进行深度优先搜索过程中在当前节点下，再向下搜索一层可以达到的节点）。使用叶子节点表示最深一层节点。</div><div class="notion-bookmark-link"><div class="notion-bookmark-link-icon"><img src="https://www.notion.so/image/https%3A%2F%2Fwuli.wiki%2Fassets%2Fimg%2Fapple-touch-icon.png?table=block&amp;id=1e28d58b-e5e0-8023-8e65-e68bad8a75a5&amp;t=1e28d58b-e5e0-8023-8e65-e68bad8a75a5" alt="Minimax 搜索和 Alpha-Beta 剪枝 - 小时百科" loading="lazy" decoding="async"/></div><div class="notion-bookmark-link-text">https://wuli.wiki/changed/mmsab.html</div></div></div></a></div><ol start="2" class="notion-list notion-list-numbered notion-block-1e28d58be5e080d1a68de970ec551d41" style="list-style-type:decimal"><li><b>alpha-beta</b> 搜索</li></ol><ol start="2" class="notion-list notion-list-numbered notion-block-1e28d58be5e08055b6c3f0b86a0cb7c3" style="list-style-type:decimal"><li><b>蒙特卡洛树</b>搜索（MCTS）</li></ol><div class="notion-row"><a class="notion-bookmark notion-block-1e28d58be5e080c5b6e7dafd0be576f3" href="https://wuli.wiki/changed/MCTS.html" target="_blank" rel="noopener noreferrer"><div><div class="notion-bookmark-title">蒙特卡洛树搜索算法（理论） - 小时百科</div><div class="notion-bookmark-description">蒙特卡洛树是一种不同于 Alpha-Beta 剪枝的优化 Min-Max 搜索方法。他与 Alpha-Beta 剪枝相比，更好的适用于诸如围棋一类的大型对弈游戏（即搜索空间过大，但搜索过程需要兼顾 “探索” 与 “最优化”，尽量得到全局最优解，避免陷入局部最优解），而 Alpha-Beta 剪枝的 Min-Max 搜索需要扩展几乎整个搜索树。但与 Alpha-Beta 剪枝相比，由于过程中采用蒙特卡洛方法（可以理解为抽样检测），搜索的结果并不保证一定是最优解。</div><div class="notion-bookmark-link"><div class="notion-bookmark-link-icon"><img src="https://www.notion.so/image/https%3A%2F%2Fwuli.wiki%2Fassets%2Fimg%2Fapple-touch-icon.png?table=block&amp;id=1e28d58b-e5e0-80c5-b6e7-dafd0be576f3&amp;t=1e28d58b-e5e0-80c5-b6e7-dafd0be576f3" alt="蒙特卡洛树搜索算法（理论） - 小时百科" loading="lazy" decoding="async"/></div><div class="notion-bookmark-link-text">https://wuli.wiki/changed/MCTS.html</div></div></div></a></div><div class="notion-text notion-block-1e28d58be5e0807287bdc63a5a1e18ef"><span class="notion-link-mention"><a href="https://wuli.wiki/changed/MCTSci.html" target="_blank" rel="noopener noreferrer" class="notion-link-mention-link"><img class="notion-link-mention-icon" src="https://wuli.wiki/assets/img/apple-touch-icon.png"/><span class="notion-link-mention-title">蒙特卡洛树搜索算法（实现 TicTacToe 机-机对战） - 小时百科</span></a><div class="notion-link-mention-preview"><article class="notion-link-mention-card"><img class="notion-link-mention-preview-thumbnail" alt="蒙特卡洛树搜索算法（实现 TicTacToe 机-机对战） - 小时百科" referrerPolicy="same-origin"/><div class="notion-link-mention-preview-content"><p class="notion-link-mention-preview-title">蒙特卡洛树搜索算法（实现 TicTacToe 机-机对战） - 小时百科</p><p class="notion-link-mention-preview-description">本文使用了 python 3.7 中提供的特性（future 中的 annotations）与 numpy 库。使用版本 pytohn 3.12.2 与 numpy 1.26.4 可以确保无问题运行。全部代码可以在笔者的 Github 仓库查看：
https://github.com/tripleInt/MCTS-TTT/，或 Pastebin https://paste.ubuntu.com/p/NQtdDSx3sY/。</p><div class="notion-link-mention-preview-footer"><img class="notion-link-mention-preview-icon" src="https://wuli.wiki/assets/img/apple-touch-icon.png" referrerPolicy="same-origin"/><span class="notion-link-mention-preview-provider"></span></div></div></article></div></span></div><div class="notion-text notion-block-1e28d58be5e0805f91c3d2ab1f56409e"><b>UCB</b> 算法 <a class="notion-link" href="https://wuli.wiki/changed/MCTSci.html" target="_blank" rel="noopener noreferrer">井字棋实现</a></div><div class="notion-row"><a class="notion-bookmark notion-block-1e28d58be5e080888aeee9c255e7490b" href="https://youtu.be/UXW2yZndl7U?si=zGlXSdRKUSBFcZgi" target="_blank" rel="noopener noreferrer"><div><div class="notion-bookmark-title">Monte Carlo Tree Search</div><div class="notion-bookmark-description">This is a video I made for my class &quot;CS310: Foundations of Artificial Intelligence&quot; at the University of Strathclyde. The video has a brief description of the Monte Carlo Tree Search algorithm and includes a worked example.</div><div class="notion-bookmark-link"><div class="notion-bookmark-link-icon"><img src="https://www.notion.so/image/https%3A%2F%2Fwww.youtube.com%2Fs%2Fdesktop%2Fd0d7a350%2Fimg%2Flogos%2Ffavicon_144x144.png?table=block&amp;id=1e28d58b-e5e0-8088-8aee-e9c255e7490b&amp;t=1e28d58b-e5e0-8088-8aee-e9c255e7490b" alt="Monte Carlo Tree Search" loading="lazy" decoding="async"/></div><div class="notion-bookmark-link-text">https://youtu.be/UXW2yZndl7U?si=zGlXSdRKUSBFcZgi</div></div></div><div class="notion-bookmark-image"><img style="object-fit:cover" src="https://www.notion.so/image/https%3A%2F%2Fi.ytimg.com%2Fvi%2FUXW2yZndl7U%2Fmaxresdefault.jpg?table=block&amp;id=1e28d58b-e5e0-8088-8aee-e9c255e7490b&amp;t=1e28d58b-e5e0-8088-8aee-e9c255e7490b" alt="Monte Carlo Tree Search" loading="lazy" decoding="async"/></div></a></div><div class="notion-text notion-block-1e28d58be5e080c88faac7d79858e0fa"><a class="notion-link" href="https://youtu.be/UXW2yZndl7U?si=zGlXSdRKUSBFcZgi" target="_blank" rel="noopener noreferrer">蒙特卡洛树搜索的最佳讲解</a></div><ol start="4" class="notion-list notion-list-numbered notion-block-1e28d58be5e08031b951da06722757f0" style="list-style-type:decimal"><li>基于模型的树搜索（如<b>MuZero</b>）</li></ol><div class="notion-text notion-block-1e28d58be5e080f29be0d2c4d62da415">MuZero 论文发表在 Nature</div><div class="notion-row"><a class="notion-bookmark notion-block-1e28d58be5e0809b94c2efe358226f2a" href="https://www.nature.com/articles/s41586-020-03051-4" target="_blank" rel="noopener noreferrer"><div><div class="notion-bookmark-title">Mastering Atari, Go, chess and shogi by planning with a learned model</div><div class="notion-bookmark-description">Nature - A reinforcement-learning algorithm that combines a tree-based search with a learned model achieves superhuman performance in high-performance planning and visually complex domains, without...</div><div class="notion-bookmark-link"><div class="notion-bookmark-link-icon"><img src="https://www.notion.so/image/https%3A%2F%2Fwww.nature.com%2Fstatic%2Fimages%2Ffavicons%2Fnature%2Fapple-touch-icon-f39cb19454.png?table=block&amp;id=1e28d58b-e5e0-809b-94c2-efe358226f2a&amp;t=1e28d58b-e5e0-809b-94c2-efe358226f2a" alt="Mastering Atari, Go, chess and shogi by planning with a learned model" loading="lazy" decoding="async"/></div><div class="notion-bookmark-link-text">https://www.nature.com/articles/s41586-020-03051-4</div></div></div><div class="notion-bookmark-image"><img style="object-fit:cover" src="https://www.notion.so/image/https%3A%2F%2Fmedia.springernature.com%2Ffull%2Fspringer-static%2Fimage%2Fart%253A10.1038%252Fs41586-020-03051-4%2FMediaObjects%2F41586_2020_3051_Fig1_HTML.png?table=block&amp;id=1e28d58b-e5e0-809b-94c2-efe358226f2a&amp;t=1e28d58b-e5e0-809b-94c2-efe358226f2a" alt="Mastering Atari, Go, chess and shogi by planning with a learned model" loading="lazy" decoding="async"/></div></a></div><ol start="5" class="notion-list notion-list-numbered notion-block-1e28d58be5e080778b2ac9fc7f18402e" style="list-style-type:decimal"><li>深度反事实值最小化（<b>DeepCFR</b>）</li></ol><h3 class="notion-h notion-h2 notion-h-indent-0 notion-block-1e28d58be5e08076badccc8d8d7df7a9" data-id="1e28d58be5e08076badccc8d8d7df7a9"><span><div id="1e28d58be5e08076badccc8d8d7df7a9" class="notion-header-anchor"></div><a class="notion-hash-link" href="#1e28d58be5e08076badccc8d8d7df7a9" title="已发表的论文"><svg viewBox="0 0 16 16" width="16" height="16"><path fill-rule="evenodd" d="M7.775 3.275a.75.75 0 001.06 1.06l1.25-1.25a2 2 0 112.83 2.83l-2.5 2.5a2 2 0 01-2.83 0 .75.75 0 00-1.06 1.06 3.5 3.5 0 004.95 0l2.5-2.5a3.5 3.5 0 00-4.95-4.95l-1.25 1.25zm-4.69 9.64a2 2 0 010-2.83l2.5-2.5a2 2 0 012.83 0 .75.75 0 001.06-1.06 3.5 3.5 0 00-4.95 0l-2.5 2.5a3.5 3.5 0 004.95 4.95l1.25-1.25a.75.75 0 00-1.06-1.06l-1.25 1.25a2 2 0 01-2.83 0z"></path></svg></a><span class="notion-h-title">已发表的论文</span></span></h3><blockquote class="notion-quote notion-block-1e28d58be5e0806bb7e5fd3506dc9e0d"><div>AlphaGo、AlphaGo Zero、AlphaGo Zero；DeepStack、Libratus、
Pluribus、AlphaHoldem；SuphX；AlphaStar、OpenAI Five等</div></blockquote><div class="notion-blank notion-block-1e28d58be5e080aa94dec5e1a493072c"> </div><div class="notion-blank notion-block-1e28d58be5e0807fb475fb7fac05c59e"> </div></main></div>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[信]]></title>
            <link>http://www.yyin9116.eu.org/article/1d78d58b-e5e0-81fe-9dc7-e8e2e6eab050</link>
            <guid>http://www.yyin9116.eu.org/article/1d78d58b-e5e0-81fe-9dc7-e8e2e6eab050</guid>
            <pubDate>Sat, 06 Nov 2021 00:00:00 GMT</pubDate>
            <description><![CDATA[ 紫罗兰]]></description>
            <content:encoded><![CDATA[<div id="notion-article" class="mx-auto overflow-hidden "><main class="notion light-mode notion-page notion-block-1d78d58be5e081fe9dc7e8e2e6eab050"><div class="notion-viewport"></div><div class="notion-collection-page-properties"></div><div class="notion-blank notion-block-1dd8d58be5e080b1b92ef84dfa87b735"> </div><div class="notion-text notion-block-1d98d58be5e080aaa0a5f6a4932f8fb4">亲爱的索菲亚：</div><div class="notion-text notion-block-1d98d58be5e080ae8fd5e42193f24695">
温度变冷已经有几个月了，只是大雪还没有到来。</div><div class="notion-text notion-block-1d98d58be5e08068bc03e4335ebe1aa6">华盛顿的天气怎么样？</div><div class="notion-text notion-block-1d98d58be5e08066ad27ce2d85903a7d">你还在生我的气吗？</div><div class="notion-text notion-block-1d98d58be5e08006a929d0523089143b">我知道道歉无法获得你的原谅，所以我准备了一些花给你，就在信封的背面。</div><div class="notion-blank notion-block-1d98d58be5e0802fbb91f0deddd7e6f8"> </div><div class="notion-text notion-block-1d98d58be5e0805b8829fdda09654eab">新鲜的花抵不住寒风，所以你会看到这些我用纸折的紫罗兰。</div><div class="notion-text notion-block-1d98d58be5e080edbcf0c40cbc68cb36">但愿它能让你开心起来。</div><div class="notion-blank notion-block-1d98d58be5e0809b9567d38cda782fef"> </div><div class="notion-text notion-block-1d98d58be5e080a0a8e4f801cff7eb65">当然，希望它能撑过这个冬天。</div><div class="notion-blank notion-block-1dd8d58be5e0800a9a5bf2835159bf6e"> </div><div class="notion-blank notion-block-1dd8d58be5e0804cb14be7757d3cf74f"> </div></main></div>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[文字生长]]></title>
            <link>http://www.yyin9116.eu.org/article/1d78d58b-e5e0-81a3-a996-f83fdd324df2</link>
            <guid>http://www.yyin9116.eu.org/article/1d78d58b-e5e0-81a3-a996-f83fdd324df2</guid>
            <pubDate>Sun, 14 Nov 2021 00:00:00 GMT</pubDate>
            <description><![CDATA[原来它们也…]]></description>
            <content:encoded><![CDATA[<div id="notion-article" class="mx-auto overflow-hidden "><main class="notion light-mode notion-page notion-block-1d78d58be5e081a3a996f83fdd324df2"><div class="notion-viewport"></div><div class="notion-collection-page-properties"></div><h2 class="notion-h notion-h1 notion-h-indent-0 notion-block-1d98d58be5e08089aee5ddd131ccfac8" data-id="1d98d58be5e08089aee5ddd131ccfac8"><span><div id="1d98d58be5e08089aee5ddd131ccfac8" class="notion-header-anchor"></div><a class="notion-hash-link" href="#1d98d58be5e08089aee5ddd131ccfac8" title="文字生长"><svg viewBox="0 0 16 16" width="16" height="16"><path fill-rule="evenodd" d="M7.775 3.275a.75.75 0 001.06 1.06l1.25-1.25a2 2 0 112.83 2.83l-2.5 2.5a2 2 0 01-2.83 0 .75.75 0 00-1.06 1.06 3.5 3.5 0 004.95 0l2.5-2.5a3.5 3.5 0 00-4.95-4.95l-1.25 1.25zm-4.69 9.64a2 2 0 010-2.83l2.5-2.5a2 2 0 012.83 0 .75.75 0 001.06-1.06 3.5 3.5 0 00-4.95 0l-2.5 2.5a3.5 3.5 0 004.95 4.95l1.25-1.25a.75.75 0 00-1.06-1.06l-1.25 1.25a2 2 0 01-2.83 0z"></path></svg></a><span class="notion-h-title">文字生长</span></span></h2><div class="notion-text notion-block-1d98d58be5e0806386d1c6c0beba6c85">文字。</div><div class="notion-text notion-block-1d98d58be5e08000bcf2d85796a8a0a0">
它写在哪里，它就恒定不变，这就是文字的荒漠。</div><div class="notion-text notion-block-1d98d58be5e0805e922fcf417ed9470a">
而在文字生长的草原上，当一个个文字写下后许久没有续写时，他们会逐渐生长，或许是组成词语，或许连成一句问候，但是没有人回应的话，长出的问候也会感到失落，从一句问句变成陈述，生长成一句以句号结尾的抱怨，无用的抱怨也会变得沉默，以一句短炼的感想结束，最终归于无言，文字的生长到达尽头，重新变回文字荒漠。</div><div class="notion-text notion-block-1d98d58be5e080fc8375f1958a025325">
但是倘若文字们在问候中得到了来自原作者，或者长大后的原作者，或是原作者的后人，甚至是无意中翻阅到这些文字的读者的回应时，孤零零的文字将不再孤独，他们也有了陪伴，能够更好的生长下去，他们长成了一句幸福的回忆，成为了一场美好的愿景。当后人的后人再次看到这些文字时，他们已变成了诗，变成了日记，长成了一片广袤的草原，夕阳下的海平面，天空中沉稳飞行的帆船，或是别的什么东西……他们是什么已经不重要了，重要的是，他们获得了感情。</div><div class="notion-text notion-block-1d98d58be5e08013a701ccd16a145f5d">
这里不再是荒漠。</div><div class="notion-text notion-block-1d98d58be5e0805dbc3ec3c97edb1fde">
一切都源于我在某个日记本上写了几个字便不知丢到哪里去了，我继续我的人生，而他们也开始生长。如果没有我，他们不会出现，可正是因为我，他们能够生长。</div><div class="notion-text notion-block-1d98d58be5e080c1a7d5fa411fc7024c">
我们都期待重逢。</div></main></div>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[我曾…]]></title>
            <link>http://www.yyin9116.eu.org/article/1d78d58b-e5e0-8191-980f-c404f8263c55</link>
            <guid>http://www.yyin9116.eu.org/article/1d78d58b-e5e0-8191-980f-c404f8263c55</guid>
            <pubDate>Fri, 02 Jul 2021 00:00:00 GMT</pubDate>
            <content:encoded><![CDATA[<div id="notion-article" class="mx-auto overflow-hidden "><main class="notion light-mode notion-page notion-block-1d78d58be5e08191980fc404f8263c55"><div class="notion-viewport"></div><div class="notion-collection-page-properties"></div><div class="notion-text notion-block-1d98d58be5e08006aa83d86af6c90577">我曾七次鄙视自己的灵魂</div><div class="notion-text notion-block-1d98d58be5e08010a18beb62ad85e6b5">第一次，当它本可进取时，却故作谦卑；</div><div class="notion-text notion-block-1d98d58be5e0804da070f0049fa38d37">第二次，当它在空虚时，用爱欲来填充；</div><div class="notion-text notion-block-1d98d58be5e080b8870aedd12f8ca216">第三次，在困难和容易之间，它选择了容易；</div><div class="notion-text notion-block-1d98d58be5e0809c98c4e10022ea6b70">第四次，它犯了错，却借由别人也会犯错来宽慰自己；</div><div class="notion-text notion-block-1d98d58be5e08067a790d19b0378b525">第五次，它自由软弱，却把它认为是生命的坚韧；</div><div class="notion-text notion-block-1d98d58be5e08034b7bffff727aa8561">第六次，当它鄙夷一张丑恶的嘴脸时，却不知那正是自己面具中的一副；</div><div class="notion-text notion-block-1d98d58be5e080af84d1f6a0934cbde7">第七次，它侧身于生活的污泥中，虽不甘心，却又畏首畏尾。<div class="notion-text-children"><div class="notion-text notion-block-1d98d58be5e0809baeaff60b91c084a7">                                     ——纪·哈·纪伯伦</div></div></div></main></div>]]></content:encoded>
        </item>
    </channel>
</rss>