I watched this at the beginning of April via jonas's comment, but it was well worth a second watch now. Fun video. Part of me wants more Tom 7 Albums-a-Day, but if this is the form of creativity that inspires you now, I'm not complaining. Good luck in the marathon! |
| |
|
|
| |
Hi Tom, at the end of the paper, you write "Please see http://tom7.org/nan" but it appears that project page is actually "http://tom7.org/nand". What do I do? Best regards. |
| |
The next month is never more than 31 days away! |
| |
Thanks! I'm using PCBWay, which also supports four+ layer, but (like basically anything that strays from the defaults) it increases the price from "suspiciously cheap" to "that's kinda what I expected." That's still somehow hard for me to justify to myself even though I'm willing to pour dozens of hours into the project, take vacation days, etc. (?). Of course the real reason to stick with two-layer is that it makes it more challenging to hand-route the board! |
| |
13620. calendar (176.63.24.170) –
30 Apr 2019 17:40:53
[ CHESSBOVIK ]
You have less than half a day to write an entry for month 04. |
| |
This one and #23 have grown on me a lot over the years. Turtledog, Hot Interrobang, Mr. Natural and Ghostlines are all choice.
Also my fake bad review above just seems mean now. Sorry! It was supposed to be funny. |
| |
|
|
| |
|
|
| |
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 2019 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 2019 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 2019 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?? |
| |