Ray Chason: Improve support for 24 bit color images

2026-05-19T02:04:17Z

Improve support for 24 bit color images

Ray Chason: Upload and describe this program

2026-05-03T14:52:12Z

Upload and describe this program

New page

Here is a [[wikipedia:Python (programming language)|Python]] program that will take a [[NetHack 3.6.7]] [[tileset]] in BMP format and convert it to a form usable with 5.0.0.

If you have a [[Mac]] or [[Linux]], you probably already have Python (or can install it with your package manager). Windows users can run this with [https://www.activestate.com/activepython ActiveState Python].

Use <code>./tile2500.py -h</code> for a complete list of options. Most tilesets convert without needing any options; the program assumes that the image contains 40 tiles per row and that tiles are square, unless the tile size is given. The output file name just adds "-500" before the ".bmp" suffix, unless the command line specifies a different name.

New tiles are created as follows:

* Monsters now have separate tiles for male and female forms. This includes single-gender monsters. If separate tiles are not available in the 3.6.7 tileset, the single tile is duplicated.
* The wooden shield tile is duplicated to make shields of drain resistance and shock resistance. This duplication should likely be left alone.
* Tiles for stairs and ladders are duplicated to make branch stairs and branch ladders.
* The single [[altar]] tile is duplicated to make unaligned, chaotic, neutral, lawful and "other" altars.
* The [[molten lava]] tile is duplicated to make a tile for the [[wall of lava]].
* The positions for "unexplored" and "nothing" use the "stone" tile.

The following tiles are replaced with a red X box as a placeholder; for monsters, this applies to the male and female forms and also the statues:
* displacer beast
* baby gold dragon
* gold dragon
* genetic engineer
* generic strange
* generic weapon
* generic armor
* generic ring
* generic amulet
* generic tool
* generic food
* generic potion
* generic scroll
* generic spellbook
* generic wand
* generic coin
* generic gem
* generic large rock
* generic iron ball
* generic iron chain
* generic venom
* silver mace
* crystal helmet
* gold dragon scale mail
* gold dragon scales
* perforated amulet
* cubical amulet
* checkered spellbook
* redwood wand
* engraving in a room
* engraving in a corridor
* trapped door
* trapped chest

<pre><nowiki>
#!/usr/bin/env python
# tile2500.py -- convert NetHack 3.6.x tile sets most of the way to 5.0.0
#
# Copyright (c) 2026, Ray Chason
# All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are met:
#
# 1. Redistributions of source code must retain the above copyright notice, this
# list of conditions and the following disclaimer.
#
# 2. Redistributions in binary form must reproduce the above copyright notice,
# this list of conditions and the following disclaimer in the documentation
# and/or other materials provided with the distribution.
#
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
# POSSIBILITY OF SUCH DAMAGE.

import argparse
import os.path
import struct
import sys

# A Bitmap image, with some extra methods for tile mapping
class Bitmap(object):
def __init__(self, inpname):
# TODO: This assumes the BITMAPINFOHEADER structure. Add support for
# other bitmap formats.

# Read the header
fp = open(inpname, "rb")
header = fp.read(54)

(magic,
self.bmp_size,
reserved,
self.image_offset,
self.header_size,
self.width,
self.height,
self.num_planes,
self.bits_per_pixel,
self.compression,
self.image_size,
self.horiz_res,
self.vert_res,
self.num_colors,
self.num_important_colors) = struct.unpack("<2s6L2H6L", header)

# Check various header fields for unsupported stuff
if magic != b"BM":
raise RuntimeError("%s is not in .BMP format" % inpname)

if self.header_size != 40:
raise RuntimeError("%s has an unsupported header type (%d)" % \
(inpname, self.header_size))

if self.num_planes != 1:
raise RuntimeError("%s has %d planes, not supported" % \
(inpname, self.num_planes))

if self.compression != 0:
raise RuntimeError("%s is compressed (%d), and not supported" % \
(inpname, self.compression))

if self.bits_per_pixel not in (1, 2, 4, 8, 24, 32):
raise RuntimeError("%s has %d bits per pixel, not supported" % \
(inpname, self.bits_per_pixel))

# Read the palette
if self.bits_per_pixel <= 8:
if self.num_colors == 0:
self.num_colors = 1 << self.bits_per_pixel
self.palette = [ None ] * self.num_colors
for i in range(0, self.num_colors):
b, g, r, z = struct.unpack("<4B", fp.read(4))
self.palette[i] = (b, g, r)
else:
self.palette = None

# Read the pixels
fp.seek(self.image_offset)
self.image = [ None ] * self.height
row_size = ((self.bits_per_pixel * self.width + 31) // 32) * 4
if self.bits_per_pixel <= 8:
# Palettized image; convert to 24 bit
pixels_per_byte = 8 // self.bits_per_pixel
mask = (1 << self.bits_per_pixel) - 1
for y in range(0, self.height):
row_bytes = fp.read(row_size)
row_bytes = list(map(
lambda x : struct.unpack('<1B', bytearray([x]))[0],
row_bytes))
row = [ None ] * self.width
self.image[self.height - 1 - y] = row
shift = 8
for x in range(0, self.width):
if shift <= 0:
shift = 8
shift -= self.bits_per_pixel
x_hi = x // pixels_per_byte
i = (row_bytes[x_hi] >> shift) & mask
row[x] = self.palette[i]
else:
# 24 or 32 bits per pixel
bytes_per_pixel = self.bits_per_pixel // 8
for y in range(0, self.height):
row_bytes = fp.read(row_size)
row_bytes = map(
lambda x : struct.unpack('<1B', x)[0],
row_bytes)
row = [ None ] * self.width
self.image[self.height - 1 - y] = row
for x in range(0, self.width):
x2 = x * bytes_per_pixel
row[x] = tuple(row_bytes[x2 : x2 + 3])
self.bits_per_pixel = 24

# These are yet unknown
self.tile_width = None
self.tile_height = None
self.tiles_per_row = None
self.tile_rows = None
self.tiles = None

# Split the image into tiles
def split(self, tile_width, tile_height):
self.tile_width = tile_width
self.tile_height = tile_height
self.tiles_per_row = self.width // tile_width
self.tile_rows = self.height // tile_height
num_tiles = self.tiles_per_row * self.tile_rows
self.tiles = [ None ] * num_tiles

for t in range(0, num_tiles):
tile = [ None ] * tile_height
self.tiles[t] = tile
t_col = t % self.tiles_per_row
t_row = t // self.tiles_per_row
t_x = t_col * tile_width
t_y = t_row * tile_height
for y in range(0, tile_height):
tile[y] = self.image[t_y + y][t_x : t_x + tile_width]

# Rearrange the tiles to match the NetHack 5.0.0 order
def remap(self):
# Monster map. This is used for monsters themselves, and also for
# statues.
# Each position in the array stands for two tiles. Where 3.6.x uses
# a single tile for male and female monsters (or the monster is single
# gender), here we use a single number.
# A tuple of two elements maps separate 3.6.x tiles for male and female
# monsters.
# If the element is None, use the placeholder tile.
# The invisible monster marker is ungendered and is placed in tile_map.
monster_map = [
# giant ant through tiger
0, 1, 2, 3, 4, 5, 6, 7, 8, 9,
10, 11, 12, 13, 14, 15, 16, 17, 18, 19,
20, 21, 22, 23, 24, 25, 26, 27, 28, 29,
30, 31, 32, 33, 34, 35, 36, 37, 38, 39,
40,
# New monster: displacer beast
None,
# gremlin through baby gray dragon
41, 42, 43, 44, 45, 46, 47, 48, 49, 50,
51, 52, 53, 54, 55, 56, 57, 58, 59, 60,
61, 62, 63, 64, 65, 66, 67, 68, 69, 70,
71, 72, 73, 74, 75, 76, 77, 78, 79, 80,
81, 82, 83, 84, 85, 86, 87, 88, 89, 90,
91, 92, 93, 94, 95, 96, 97, 98, 99, 100,
101, 102, 103, 104, 105, 106, 107, 108, 109, 110,
111, 112, 113, 114, 115, 116, 117, 118, 119, 120,
121, 122, 123, 124, 125, 126, 127, 128, 129, 130,
131, 132, 133, 134,
# New monster: baby gold dragon
None,
# baby silver dragon through gray dragon
135, 136, 137, 138, 139, 140, 141, 142, 143, 144,
# New monster: gold dragon
None,
# silver dragon through quantum mechanic
145, 146, 147, 148, 149, 150, 151, 152, 153, 154,
155, 156, 157, 158, 159, 160, 161, 162, 163, 164,
165, 166, 167, 168, 169, 170, 171, 172, 173, 174,
175, 176, 177, 178, 179, 180, 181, 182, 183, 184,
185, 186, 187, 188, 189, 190, 191, 192, 193, 194,
195, 196, 197, 198, 199, 200, 201, 202, 203, 204,
205, 206, 207, 208, 209, 210, 211, 212,
# New monster: genetic engineer
None,
# rust monster through water demon
213, 214, 215, 216, 217, 218, 219, 220, 221, 222,
223, 224, 225, 226, 227, 228, 229, 230, 231, 232,
233, 234, 235, 236, 237, 238, 239, 240, 241, 242,
243, 244, 245, 246, 247, 248, 249, 250, 251, 252,
253, 254, 255, 256, 257, 258, 259, 260, 261, 262,
263, 264, 265, 266, 267, 268, 269, 270, 271, 272,
273, 274, 275, 276, 277, 278, 279, 280, 281, 282,
283, 284, 285, 286, 287, 288, 289, 290, 291, 292,
# incubus and succubus map to amorous demon
(295, 293),
# horned devil is reordered
294,
# erinys through barbarian
296, 297, 298, 299, 300, 301, 302, 303, 304, 305,
306, 307, 308, 309, 310, 311, 312, 313, 314, 315,
316, 317, 318, 319, 320, 321, 322, 323, 324, 325,
326, 327, 328, 329, 330, 331, 332, 333, 334, 335,
336,
# caveman and cavewoman map to cave dweller
(337, 338),
# healer through monk
339, 340, 341,
# priest and priestess map to cleric
(342, 343),
# ranger through apprentice
344, 345, 346, 347, 348, 349, 350, 351, 352, 353,
354, 355, 356, 357, 358, 359, 360, 361, 362, 363,
364, 365, 366, 367, 368, 369, 370, 371, 372, 373,
374, 375, 376, 377, 378, 379, 380, 381, 382, 383,
384, 385, 386, 387, 388, 389, 390, 391, 392
]
# Place the tile_map tiles starting here
tile_map_begin = len(monster_map) * 2
# Map for things other than monsters.
# Each position in the array stands for one tile, and indexes the tile
# position in the 3.6.x tileset.
# If the element is None, use the placeholder tile.
tile_map = [
# invisible monster
393,
# strange object
394+0,
# New tiles for generic unseen objects
None, # generic strange
None, # generic weapon
None, # generic armor
None, # generic ring
None, # generic amulet
None, # generic tool
None, # generic food
None, # generic potion
None, # generic scroll
None, # generic spellbook
None, # generic wand
None, # generic coin
None, # generic gem
None, # generic large rock
None, # generic iron ball
None, # generic iron chain
None, # generic venom
# arrow through glaive
395, 396, 397, 398, 399,
400, 401, 402, 403, 404, 405, 406, 407, 408, 409,
410, 411, 412, 413, 414, 415, 416, 417, 418, 419,
420, 421, 422, 423, 424, 425, 426, 427, 428, 429,
430, 431, 432, 433, 434, 435, 436, 437, 438, 439,
# lance and mace are reordered
441, 442, 443,
445, 446, 447, 448, 449,
444,
440,
450,
# New tile for silver mace
None,
# morning star through dented pot
451, 452, 453, 454, 455, 456, 457, 458, 459,
460, 461, 462, 463, 464, 465, 466, 467, 468, 469,
470, 471,
# Helm of brilliance becomes a crystal helmet at this position
None,
# plumed helmet through gray dragon scale mail
472, 473, 474, 475, 476,
# New tile for gold dragon scale mail
None,
# silver dragon scale mail through gray dragon scales
477, 478, 479, 480, 481, 482, 483, 484, 485, 486,
# New tile for gold dragon scales
None,
# silver dragon scales through wooden shield
487, 488, 489,
490, 491, 492, 493, 494, 495, 496, 497, 498, 499,
500, 501, 502, 503, 504, 505, 506, 507, 508, 509,
510, 511, 512, 513, 514, 515, 516, 517, 518, 519,
520, 521, 522, 523, 524, 525,
# wooden shield duplicated to make shields of drain and shock
# resistance
525, 525,
# blue and green shield through octagonal amulet
526, 527, 528, 529,
530, 531, 532, 533, 534, 535, 536, 537, 538, 539,
540, 541, 542, 543, 544, 545, 546, 547, 548, 549,
550, 551, 552, 553, 554, 555, 556, 557, 558, 559,
560, 561, 562, 563, 564, 565, 566, 567, 568, 569,
570, 571, 572, 573, 574, 575, 576, 577, 578, 579,
580, 581, 582,
# New tile for perforated amulet
None,
# New tile for cubical amulet
None,
# Fake AoY through thick spellbook
583, 584, 585, 586, 587, 588, 589,
590, 591, 592, 593, 594, 595, 596, 597, 598, 599,
600, 601, 602, 603, 604, 605, 606, 607, 608, 609,
610, 611, 612, 613, 614, 615, 616, 617, 618, 619,
620, 621, 622, 623, 624, 625, 626, 627, 628, 629,
630, 631, 632, 633, 634, 635, 636, 637, 638, 639,
640, 641, 642, 643, 644, 645, 646, 647, 648, 649,
650, 651, 652, 653, 654, 655, 656, 657, 658, 659,
660, 661, 662, 663, 664, 665, 666, 667, 668, 669,
670, 671, 672, 673, 674, 675, 676, 677, 678, 679,
680, 681, 682, 683, 684, 685, 686, 687, 688, 689,
690, 691, 692, 693, 694, 695, 696, 697, 698, 699,
700, 701, 702, 703, 704, 705, 706, 707, 708, 709,
710, 711, 712, 713, 714, 715, 716, 717, 718, 719,
720, 721, 722, 723, 724, 725, 726, 727, 728, 729,
730, 731, 732, 733, 734, 735, 736, 737, 738, 739,
740, 741, 742, 743, 744, 745, 746, 747, 748, 749,
750, 751, 752, 753, 754, 755, 756, 757, 758, 759,
760, 761, 762, 763, 764, 765, 766, 767, 768, 769,
770, 771, 772, 773, 774, 775, 776,
# New tile for checkered spellbook
None,
# plain spellbook through pine wand
777, 778, 779, 780, 781, 782, 783, 784,
# New tile for redwood wand
None,
# Oak wand through acid venom
785, 786, 787, 788, 789,
790, 791, 792, 793, 794, 795, 796, 797, 798, 799,
800, 801, 802, 803, 804, 805, 806, 807, 808, 809,
810, 811, 812, 813, 814, 815, 816, 817, 818, 819,
820, 821, 822, 823, 824, 825, 826, 827, 828, 829,
830, 831, 832, 833, 834, 835, 836, 837, 838, 839,
840, 841, 842, 843, 844, 845, 846, 847, 848, 849,

# Dungeon features
# stone through dark part of a room
850, 851, 852, 853, 854, 855, 856, 857, 858, 859,
860, 861, 862, 863, 864, 865, 866, 867, 868, 869,
870,
# New tile for engraving in a room
None,
# corridor and lit corridor
871, 872,
# New tile for engraving in a corridor
None,
# staircase up through ladder down
873, 874, 875, 876,
# staircases and ladders duplicated for branch stairs and ladders
873, 874, 875, 876,
# altar duplicated: unaligned, chaotic, neutral, lawful, other
877, 877, 877, 877, 877,
# grave through molten lava
878, 879, 880, 881, 882, 883, 884,
# molten lava duplicated for wall of lava
884,
# vertical open drawbridge through vibrating square
885, 886, 887, 888, 889,
890, 891, 892, 893, 894, 895, 896, 897, 898, 899,
900, 901, 902, 903, 904, 905, 906, 907, 908, 909,
910, 911, 912, 913, 914,
# New tile for trapped door
None,
# New tile for trapped chest
None,
# missile zaps through acid zaps (reordered)
1000, 1001, 1002, 1003, 1004, 1005, 1006, 1007, 1008, 1009,
1010, 1011, 1012, 1013, 1014, 1015, 1016, 1017, 1018, 1019,
1020, 1021, 1022, 1023, 1024, 1025, 1026, 1027, 1028, 1029,
1030, 1031,
# dig beam through explosion frosty bottom right
# Tiles 915 through 918 are unused and are deleted
919,
920, 921, 922, 923, 924, 925, 926, 927, 928, 929,
930, 931, 932, 933, 934, 935, 936, 937, 938, 939,
940, 941, 942, 943, 944, 945, 946, 947, 948, 949,
950, 951, 952, 953, 954, 955, 956, 957, 958, 959,
960, 961, 962, 963, 964, 965, 966, 967, 968, 969,
970, 971, 972, 973, 974, 975, 976, 977, 978, 979,
980, 981, 982, 983, 984, 985, 986, 987, 988, 989,
990, 991, 992, 993, 994, 995, 996, 997, 998, 999,
# warnings
1032, 1033, 1034, 1035, 1036, 1037,
# unexplored and nothing reuse the tile for stone
850, 850,
# mines walls through sokoban walls
1038, 1039,
1040, 1041, 1042, 1043, 1044, 1045, 1046, 1047, 1048, 1049,
1050, 1051, 1052, 1053, 1054, 1055, 1056, 1057, 1058, 1059,
1060, 1061, 1062, 1063, 1064, 1065, 1066, 1067, 1068, 1069,
1070, 1071, 1072, 1073, 1074, 1075, 1076, 1077, 1078, 1079,
1080, 1081
]
# Place the statues starting here
statues_begin = tile_map_begin + len(tile_map)
# First statue tile in the 3.6.x map
statues_begin_36 = 1082
# Place the invisible monster statue here
invis_monster_statue = statues_begin + len(monster_map) * 2
invis_monster_statue_36 = statues_begin_36 + tile_map[0]

# The new tile map
map_size = invis_monster_statue + 1
new_tiles = [ None ] * map_size

# Map the monsters and the statues
for i in range(0, len(monster_map)):
i_m = i*2 + 0 # male
i_f = i*2 + 1 # female
m = monster_map[i]
if m is None:
new_tiles[i_m] = self.placeHolderTile()
new_tiles[i_f] = self.placeHolderTile()
new_tiles[i_m+statues_begin] = self.placeHolderTile()
new_tiles[i_f+statues_begin] = self.placeHolderTile()
elif isinstance(m, tuple):
new_tiles[i_m] = self.tiles[m[0]]
new_tiles[i_f] = self.tiles[m[1]]
new_tiles[i_m+statues_begin] = self.tiles[m[0]+statues_begin_36]
new_tiles[i_f+statues_begin] = self.tiles[m[1]+statues_begin_36]
else:
new_tiles[i_m] = self.tiles[m]
new_tiles[i_f] = self.tiles[m]
new_tiles[i_m+statues_begin] = self.tiles[m+statues_begin_36]
new_tiles[i_f+statues_begin] = self.tiles[m+statues_begin_36]

# Map the invisible monster, the objects and the dungeon features
for i in range(0, len(tile_map)):
m = tile_map[i]
if m is None:
new_tiles[i+tile_map_begin] = self.placeHolderTile()
else:
new_tiles[i+tile_map_begin] = self.tiles[m]

# Place the invisible monster statue
new_tiles[invis_monster_statue] = self.tiles[invis_monster_statue_36]

# Update the number of tile rows
self.tile_rows = (len(new_tiles) + self.tiles_per_row - 1) \
// self.tiles_per_row

# Add some blank tiles to fill out the last row
num_tiles = self.tile_rows * self.tiles_per_row
if len(new_tiles) < num_tiles:
blank_tile = self.blankTile()
while len(new_tiles) < num_tiles:
new_tiles.append(blank_tile)
self.tiles = new_tiles

# Rejoin the tiles into a new image
def join(self):
# New image dimensions; normally width will be unchanged
self.width = self.tiles_per_row * self.tile_width
self.height = self.tile_rows * self.tile_height

# Create blank image
self.image = [ None ] * self.height
for i in range(0, self.height):
self.image[i] = []

# Add each tile to the end of its row
for i in range(0, len(self.tiles)):
t_row = i // self.tiles_per_row
t_y = t_row * self.tile_height
tile = self.tiles[i]
for j in range(0, self.tile_height):
self.image[t_y + j].extend(tile[j])

# Write the image to the output file
def write(self, outname):
fp = open(outname, "wb")

# Write a palettized image if possible without degradation
self.buildPalette()
palette_map = {}
if self.bits_per_pixel <= 8:
for i in range(0, len(self.palette)):
palette_map[self.palette[i]] = i

# Write the header, with placeholders for some fields
self.writeHeader(fp)

# Write the palette if any
if self.bits_per_pixel <= 8:
for i in range(0, self.num_colors):
fp.write(struct.pack("<4B",
self.palette[i][0],
self.palette[i][1],
self.palette[i][2],
0))
self.image_offset = fp.tell()

# Write the pixels
row_size = ((self.bits_per_pixel * self.width + 31) // 32) * 4
if self.bits_per_pixel <= 8:
for y in range(0, self.height):
row = self.image[self.height - 1 - y]
bits = 0
byte = 0
count = 0
for x in range(0, self.width):
index = palette_map[row[x]]
byte = (byte << self.bits_per_pixel) | index
bits += self.bits_per_pixel
if bits >= 8:
fp.write(struct.pack("<1B", byte))
byte = 0
bits = 0
count += 1
if bits != 0:
byte <<= 8 - bits
fp.write(struct.pack("<1B", byte))
count += 1
while count < row_size:
fp.write(struct.pack("<1B", 0))
count += 1
else:
for y in range(0, self.height):
row = self.image[self.height - 1 - y]
for x in range(0, self.width):
for byte in row[x]:
fp.write(struct.pack("<1B", byte))
count = len(row) * len(row[0])
while count < row_size:
fp.write(struct.pack("<1B", 0))
count += 1

# Write the header with the correct offsets
self.bmp_size = fp.tell()
fp.seek(0)
self.writeHeader(fp)

# Given the existing image, build a palette if possible
# If there are more than 256 unique colors, build no palette; we will
# write a 24 bit bitmap
def buildPalette(self):
# Collect all colors present in the image
color_count = {}
for row in self.image:
for pixel in row:
if pixel not in color_count:
color_count[pixel] = 0
color_count[pixel] += 1

# Get the list of unique colors; this will be the palette
palette = list(color_count.keys())
self.num_colors = len(palette)
if self.num_colors > 256:
# We will write a 24 bit bitmap
self.bits_per_pixel = 24
self.palette = None
return

# Arrange in descending order of occurrence
palette.sort(key=lambda a : -color_count[a])

# Set a valid bit-per-pixel count, with the fewest bits that will
# encompass the palette
self.palette = palette
if self.num_colors < 2:
self.bits_per_pixel = 1
elif self.num_colors < 4:
self.bits_per_pixel = 2
elif self.num_colors < 16:
self.bits_per_pixel = 4
else:
self.bits_per_pixel = 8

# A black tile, to fill the last row
def blankTile(self):
return [ [ (0, 0, 0) ] * self.tile_width ] * self.tile_height

# A placeholder tile, for the tiles that cannot otherwise be derived
# This will appear as a red block with a black X through it
def placeHolderTile(self):
red = ( 0x00, 0x00, 0xFF )
black = ( 0x00, 0x00, 0x00 )
tile = [ None ] * self.tile_height
for y in range(0, self.tile_height):
tile[y] = [ red ] * self.tile_width
m = min(self.tile_width, self.tile_height)
for x in range(0, m):
tile[x][x] = black
tile[x][m - 1 - x] = black
return tile

# Write a BITMAPINFOHEADER-type header for a BMP file
def writeHeader(self, fp):
fp.write(struct.pack("<2s6L2H6L",
b"BM",
self.bmp_size,
0,
self.image_offset,
self.header_size,
self.width,
self.height,
self.num_planes,
self.bits_per_pixel,
self.compression,
self.image_size,
self.horiz_res,
self.vert_res,
self.num_colors,
self.num_important_colors))

# Convert one bitmap file
# inpname is the name of the file to be converted; args contains the arguments
# as parsed by the ArgumentParser object
def convertBitmap(inpname, args):
# Collect arguments from args
tile_width = args.tile_width
tile_height = args.tile_height
outname = args.output

# Provide default output file name
if outname is None:
d, n = os.path.split(inpname)
dot = n.rfind('.')
if dot != -1:
n = n[:dot]
n += '-500.bmp'
outname = os.path.join(d, n)

# Read the bitmap image
bmp = Bitmap(inpname)

# Provide default tile dimensions
if tile_width is None:
tile_width = bmp.width // 40
if tile_height is None:
tile_height = tile_width

# Split the bitmap into tiles
bmp.split(tile_width, tile_height)

# Remap into 5.0.0 arrangement
bmp.remap()

# Rejoin into a single image
bmp.join()

# Write to disk
bmp.write(outname)

# Define command line arguments for this program
parser = argparse.ArgumentParser(
formatter_class=argparse.RawDescriptionHelpFormatter,
description='Convert NetHack 3.6.x tile sets for use with 5.0.0',
epilog="""
If --tile-width is not specified, it is the image width divided by 40.
If --tile-height is not specified, it is equal to the tile width.
If --no-statues is specified, statue glyphs are copied from the 3.6.x statue
glyph; if not, statue glyphs are generated by converting the monster glyphs
to grayscale.

Images must be in BMP format.

If --output is not specified, the output file name is <input-name>-500.bmp.
Multiple images can be converted, but only if --output is not specified.
""")
parser.add_argument('images', metavar='image', type=str, nargs='+',
help='Name of a tile set image for NetHack 3.6.x')
parser.add_argument('--tile-width', '-x', dest='tile_width', type=int,
help='Width of a single tile in pixels')
parser.add_argument('--tile-height', '-y', dest='tile_height', type=int,
help='Height of a single tile in pixels')
parser.add_argument('--output', '-o', dest='output', type=str,
help='Name of output image')

args = parser.parse_args()
if len(args.images) > 1 and args.output is not None:
sys.stderr.write("Cannot specify --output with more than one image name\n")
sys.exit(1)

# Process each image in turn
rc = 0
for image in args.images:
if not convertBitmap(image, args):
rc = 1
sys.exit(rc)
</nowiki></pre>

@@ Line 91: / Line 91: @@
          # Read the header
          fp = open(inpname, "rb")
-         header = fp.read(54)
+         header1 = fp.read(18)
          (magic,
@@ Line 97: / Line 97: @@
          reserved,
          self.image_offset,
-         self.header_size,
+         self.header_size) = struct.unpack("<2s4L", header1)
          self.width,
          self.height,
          self.num_planes,
@@ Line 107: / Line 118: @@
          self.vert_res,
          self.num_colors,
-         self.num_important_colors) = struct.unpack("<2s6L2H6L", header)
+         self.num_important_colors) = struct.unpack("<2L2H6L", header2[0:36])
          # Check various header fields for unsupported stuff
          if magic != b"BM":
              raise RuntimeError("%s is not in .BMP format" % inpname)
          if self.num_planes != 1:
@@ Line 121: / Line 129: @@
                      (inpname, self.num_planes))
-         if self.compression != 0:
+         if self.compression not in (0, 3):
              raise RuntimeError("%s is compressed (%d), and not supported" % \
                      (inpname, self.compression))
@@ Line 168: / Line 176: @@
              for y in range(0, self.height):
                  row_bytes = fp.read(row_size)
-                 row_bytes = map(
+                 row_bytes = list(map(
-                         lambda x : struct.unpack('<1B', x)[0],
+                         lambda x : struct.unpack('<1B', bytearray([x]))[0],
-                         row_bytes)
+                         row_bytes))
                  row = [ None ] * self.width
                  self.image[self.height - 1 - y] = row
@@ Line 176: / Line 184: @@
                      x2 = x * bytes_per_pixel
                      row[x] = tuple(row_bytes[x2 : x2 + 3])
          self.bits_per_pixel = 24
@@ Line 666: / Line 675: @@
                  self.num_colors,
                  self.num_important_colors))
 # Convert one bitmap file

Tileset/tile2500.py - Revision history

Ray Chason: Improve support for 24 bit color images

Ray Chason: Upload and describe this program