|
|
| |
One of the things that I've learned over the years is that an excellent way to get a good result at something is to "teach Tom7 the basics of it, and watch him eclipse you rapidly". In this vein, I have wondered over the years what would happen if somebody gave you programmable logic devices: surely performance of the NANDY 1000 would be greatly improved by using some CPLDs as the basic gates, and even then, you might have enough logic left over to implement the rest of the NANDY 1000! Either that, or we'll end up with a hardware description language embedded in SML, and either of those sound like good outcomes to me.
All the same, I enjoy seeing the fruits of someone's labor in a densely routed board, and am suitably impressed. I fully expect a 4-layer board [1] with DDR3 [2] routed for next year's SIGBOVIK :-)
[1] It's more possible than it sounds! OSHPark's 4-layer process is quite good.
[2] It's, uh, comparably possible to how it sounds! |
| |
13615. jonas (176.63.24.154) –
01 Apr 17:36:10
[ CHESSBOVIK ]
You have now uploaded the video that you promise in this post: "https://www.youtube.com/watch?v=5TFDG-y-EHs" |
| |
13614. jonas (37.191.60.209) –
01 Apr 04:28:11
[ CHESSBOVIK ]
> This year I've been on a chess kick, which I think I've successfully gotten out of my system by writing all these
I thought SICO got them out of your system already.
|
| |
You have about eight hours to post the next blog entry – not that it's really needed, because we'll probably see your five SIGBOVIK articles about chess the day after. |
| |
this is awesome and creative |
| |
What is that board supposed to be? |
| |
|
|
| |
So this PCB plan, is this the one that will interface with your brain pretending it's your memory, like you suggested in the “Reverse emulating the NES” talk?
|
| |
13608. Anonymous (144.124.111.25) –
26 Feb 10:27:50
[ ARST ARSW ]
There were some interesting word combinations:
Father
Fault
Princess
Prisoner |
| |
Move the piece that can get closest to an opposing piece (hopefully on top). Since there's sure to be lots of ties, from those choose the piece that is currently the furthest to move.
|
| |
I thought that levels were sorted by published date at default? |
| |
> get it all out of my system
Inded, you have to get it out of your system. There's been four chess-related entries on IOCCC already: a C program that plays chess against the user, another C program that plays chess against the user but with a GUI, a C program that plays suicide chess, and a 6502 emulator in C with a chess program for 6502 given as an example use. It'd be very hard to win with another chess-related entry. |
| |
. Move to maximize the total number of squares controlled by your pieces.
. (Too obvious?) Maximize the number of 'points' you have, where pawn = 1, knight = 3, etc.
. Move so as to maximize the number of times the board position has appeared in previous games at chessgames.com
. Move so as to increase the symmetry of the board (under the action of switching the white and black pieces)
|
| |
Given a list of potential moves and numerical ratings of each, boost the ranking of one piece, eg knight moves always seem better than they are, or one move gets a random boost.
Make the move with the lexicographically least (or most) code in chess notation, eg a3 < O-O-O < Nc3 < Rf8. Variations can be made by renaming pieces, ranks and files.
Apply any strategy, but only move pieces adjacent to knights of either color.
Apply any strategy, but only move pieces whose square color is the same (or opposite) color where most of your (their, all) pieces are sitting, eg most of white's pieces are on black squares so white moves a piece on a black square.
Place Langton's ant on the chessboard. Iterate until the ant is on a square occupied by a chess piece which has a valid move and move that piece. Continue iterating the ant to locate the next piece to be moved. Restrict the ant to the bounds of the chessboard (identified as a torus or klein bottle) if necessary. Bonus: the ant respects the chessboard colors and changes them and the choice of move takes square color into account.
Long time listener, first time caller. This exercise is really fun, so I set a limit to five suggestions when I started. I hope you use or have already thought of one of these! |
| |
Here's one chess strategy (The Equalizer): Favor moving pieces that have moved fewer times to the squares that have received fewer of your movements. As a side effect, castling is a very desirable move. |
| |
Wow, Dick Run Claire already has a rival, a different Dick Run Claire?? |
| |
Hay. T7ES best programmer listening, aforementioned I thank. Request of M3U file updating, to include new tunes as wires-coming-out.mp3 to maximum get down when closing parentheses. Greetings of Japan. |
| |
Pac Tom vs Dick Run Claire:
https://www.vice.com/en_us/article/j5zywd/meet-dick-run-claire-the-woman-who-draws-dicks-with-running-apps |
| |
13598. Tom 7 (74.109.249.95) –
17 Jan 22:39:05
[ EOY 2018 ]
It's not a standalone thing; it's just part of the compiler internals. Definition here:
sourceforge.net/p/tom7misc/svn/HEAD/tree/trunk/abc/asm.sml
the toasm phase generates it, and the tox86 phase consumes it. Glad you enjoyed the paper! :) |
| |
13597. Bill Rowe (172.98.67.71) –
17 Jan 18:51:52
[ EOY 2018 ]
Tom: I read your ABC paper via hackaday - wonderful all the way through. Where does LLVMNOP live? |
| |
13596. Bill Rowe (50.248.36.174) –
17 Jan 17:17:29
[ EOY 2018 ]
Tom: I read your ABC paper via hackaday - wonderful all the way through. Where does LLVMNOP live? |
| |
13595. Anonymous (139.194.10.17) –
13 Jan 11:20:43
[ EOY 2018 ]
damn I expected people arguing over trump in the comment section but I guess it was shooters that were more exciting lmao |
| |
13594. A. A. (108.246.96.244) –
07 Jan 18:31:36
[ EOY 2018 ]
Since they don't make them like they used to, why not just play the classics? Surely you haven't played them all. I'm finally getting around to finishing the first half life. |
| |
Pasta sauce jars. Empty first, or course. |
| |